A branch-and-cut algorithm for the pallet loading problem
From MaRDI portal
Publication:1781574
DOI10.1016/j.cor.2004.04.010zbMath1071.90046OpenAlexW1972030218MaRDI QIDQ1781574
Ramón Alvarez-Valdés, José Manuel Tamarit, Francisco Parreño
Publication date: 27 June 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.010
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (14)
Algorithmic analysis of priority-based bin packing ⋮ A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ The minimum size instance of a Pallet Loading Problem equivalence class ⋮ Fast separation for the three-index assignment problem ⋮ Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem ⋮ Priority-based bin packing with subset constraints ⋮ The Meet-in-the-Middle Principle for Cutting and Packing Problems ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Computing stable loads for pallets ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ The pinwheel pattern and its application to the manufacturer's pallet-loading problem ⋮ On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Determining an upper bound for a class of rectangular packing problems
- How to use structural constraints to compute an upper bound for the pallet loading problem
- An exact depth-first algorithm for the pallet loading problem
- Wheel inequalities for stable set polytopes
- Rounding algorithms for covering problems
- An exact algorithm for the pallet loading problem
- A family of genetic algorithms for the pallet loading problem
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- Determining the number of internal stability of a graph
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Set Partitioning: A survey
- An Algorithm for Two-Dimensional Cutting Problems
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- Experiments with a strategic oscillation algorithm for the pallet loading problem
- The G4-Heuristic for the Pallet Loading Problem
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- On the facial structure of set packing polyhedra
- Algorithm 457: finding all cliques of an undirected graph
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- New facets for the set packing polytope
- Analysis of upper bounds for the pallet loading problem
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- A fast algorithm for two-dimensional pallet loading problems of large size
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
This page was built for publication: A branch-and-cut algorithm for the pallet loading problem
