One-dimensional relaxations and LP bounds for orthogonal packing (original) (raw)
Related papers
A new constraint programming approach for the orthogonal packing problem
Computers & Operations Research, 2008
An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
Operations Research, 2014
Recent Advances in Multi-dimensional Packing Problems
Roberto Tadei, Guido Perboli, Teodor Crainic
New Technologies - Trends, Innovations and Research, 2012
A new exact method for the two-dimensional orthogonal packing problem
European Journal of Operational Research, 2007
Intelligent Decision Support
A best-first branch-and-bound algorithm for orthogonal rectangular packing problems
International Transactions in Operational Research, 1998
Computational Aspects of Packing Problems
2016
Multi-dimensional bin packing problems with guillotine constraints
David Pisinger, Rasmus Amossen
Computers & Operations Research, 2010
Two-dimensional packing problems: A survey
2002
Invited Review Two-dimensional packing problems: A survey
European Journal of Operational Research, 2002
A note on Robot-packable and Orthogonal variants of the three-dimensional bin packing problem
2003
Lower bounds and algorithms for the 2-dimensional vector packing problem
Discrete Applied Mathematics, 2001
INFORMS Journal on Computing, 2007
A particular approach for the Three-dimensional Packing Problem with additional constraints
Computers & Operations Research, 2010
A survey on the cutting and packing problems
Bollettino dell'Unione Matematica Italiana, 2020
Symmetry breaking generalized disjunctive formulation for the strip packing problem
2015
A 5/4 Algorithm for Two-Dimensional Packing
Journal of Algorithms, 1981
Iterative approaches for solving a multi-objective 2-dimensional vector packing problem
Computers & Industrial Engineering, 2013
Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
Computers & Operations Research, 2016
Computers & Operations Research, 2007
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem
ArXiv, 2021
Multi-Objective Rectangular Packing Problem
Applications of Multi-Objective Evolutionary Algorithms, 2004
From time representation in scheduling to the solution of strip packing problems
2012
Algorithms for 3D Guillotine Cutting Problems: Unbounded Knapsack, Cutting Stock and Strip Packing
Operations Research, 2005
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
European Journal of Operational Research, 2007
Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
Springer Optimization and Its Applications, 2015