A branch-and-cut algorithm for the pallet loading problem
type: Item
instance of: scholarly article
title: A branch-and-cut algorithm for the pallet loading problem
zbMATH Open document ID: 1071.90046
published in: Computers \& Operations Research
publication date: 2005-06-27T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2183208
zbMATH Keywords: Pallet loading
zbMATH Keywords: Packing
zbMATH Keywords: Maximum independent set
author: Ramón Alvarez-Valdes
author: Francisco Parreño
author: José Manuel Tamarit
describes a project that uses: ABACUS
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.cor.2004.04.010
OpenAlex ID: W1972030218
cites work: Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
cites work: A fast algorithm for two-dimensional pallet loading problems of large size
cites work: A simple and effective recursive procedure for the manufacturer's pallet loading problem
cites work: The G4-Heuristic for the Pallet Loading Problem
cites work: An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
cites work: Experiments with a strategic oscillation algorithm for the pallet loading problem
cites work: Q4350062
cites work: A family of genetic algorithms for the pallet loading problem
cites work: How to use structural constraints to compute an upper bound for the pallet loading problem
cites work: The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
cites work: Determining an upper bound for a class of rectangular packing problems
cites work: Analysis of upper bounds for the pallet loading problem
cites work: An exact depth-first algorithm for the pallet loading problem
cites work: An exact algorithm for the pallet loading problem
cites work: A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
cites work: Determining the number of internal stability of a graph
cites work: A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
cites work: Q4054818
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: On the facial structure of set packing polyhedra
cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
cites work: Wheel inequalities for stable set polytopes
cites work: Set Partitioning: A survey
cites work: New facets for the set packing polytope
cites work: Rounding algorithms for covering problems
cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem
cites work: Computational combinatorial optimization. Optimal of probably near-optimal solutions
DOI: 10.1016/J.COR.2004.04.010
Recommended article: An exact algorithm for the pallet loading problem
Recommended article: A tabu search algorithm for the pallet loading problem
Recommended article: An efficient approach for the multi-pallet loading problem
Recommended article: An exact depth-first algorithm for the pallet loading problem
Recommended article: A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
Recommended article: A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
Recommended article: Q4795358
Recommended article: The pallet loading problem: a review of solution methods and computational experiments
Recommended article: Solving the pallet loading problem
description: scientific article; zbMATH DE number 2183208