Back to Results
First PageMeta Content
Packaging / Operations research / Discrete geometry / Bin packing problem / Mathematical optimization / Computational complexity theory / Packing problem / Carton / Bounded-error probabilistic polynomial / Theoretical computer science / Mathematics / Applied mathematics


Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The
Add to Reading List

Document Date: 2011-05-11 13:37:50

Open Document

File Size: 231,72 KB

Share Result on Facebook

Company

CPLEX / /

Country

Singapore / /

/

Facility

Australia Logistics Institute / Victoria University / National University of Singapore / /

/

IndustryTerm

non-real-time solutions / heuristic algorithm / genetic algorithm / bin-loading algorithm / good initial solutions / genetic algorithms / tabu search / tabu search framework / manufacturing / guided local search / bin packing algorithm / search space / /

Organization

Victoria University / National University of Singapore / Australia Logistics Institute / NUS Business School / /

Person

George / Mark Goh / Robert de Souza / Robinson / Yong Wu / /

/

Position

Corresponding author / /

ProvinceOrState

Georgia / /

Region

Asia Pacific / /

Technology

heuristic algorithm / RAM / Genetic algorithms / bin packing algorithm / genetic algorithm / Pentium processor / bin-loading algorithm / /

SocialTag