A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers & Operations Research2006Vol. 35(4), pp. 1281–1291
Citations Over TimeTop 10% of 2006 papers
Related Papers
- → Branch and Bound Experiments in Convex Nonlinear Integer Programming(1985)482 cited
- → A bound heuristic algorithm for solving reliability redundancy optimization(1996)22 cited
- → Characterizing the optimality gap and the optimal packings for the bin packing problem(2014)3 cited
- → A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems(2011)2 cited
- → Quasi-Physical Algorithm for the Equal Circles Packing Problem(2008)2 cited