HLearn.NPHard.BinPacking

Bin packing is one of the most well studied NP-hard problems. See wikipedia for a detailed description https://en.wikipedia.org/wiki/Bin_packing

Documentation

data BinPacking n a

Constructors

BinPacking

Fields

vector :: !(SortedVector a)

packing :: Map Int [a]

Instances

Functor (BinPacking n)

Eq a => Eq (BinPacking n a)

Ord a => Ord (BinPacking n a)

Read a => Read (BinPacking n a)

Show a => Show (BinPacking n a)

(Ord a, Ord (Ring a), Norm a, SingI Nat n) => Monoid (BinPacking n a)

(Ord a, Ord (Ring a), Norm a, SingI Nat n) => HomTrainer (BinPacking n a)

HasRing (SortedVector a) => HasRing (BinPacking n a)

(Ord a, Ord (Ring a), Norm a, SingI Nat n, Module (SortedVector a)) => Module (BinPacking n a)

(Ord a, Ord (Ring a), Norm a, SingI Nat n) => Abelian (BinPacking n a)

(Ord a, Ord (Ring a), Norm a, SingI Nat n, Group (SortedVector a)) => Group (BinPacking n a)