Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
type: Item
instance of: scholarly article
title: Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
zbMATH Open document ID: 1141.90514
author: Glaydston Mattos Ribeiro
author: Luiz Antonio Nogueira Lorena
published in: Computers \& Operations Research
publication date: 2007-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 5142329
zbMATH Keywords: pallet loading
zbMATH Keywords: lagrangean relaxation
zbMATH Keywords: column generation
describes a project that uses: CPLEX
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.cor.2005.10.008
OpenAlex ID: W2081509772
cites work: A typology of cutting and packing problems
cites work: Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
cites work: A simple and effective recursive procedure for the manufacturer's pallet loading problem
cites work: An exact algorithm for the pallet loading problem
cites work: An exact depth-first algorithm for the pallet loading problem
cites work: A branch-and-cut algorithm for the pallet loading problem
cites work: A fast algorithm for two-dimensional pallet loading problems of large size
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: A note on an L-approach for solving the manufacturer's pallet loading problem
cites work: A tabu search algorithm for the pallet loading problem
cites work: Analysis of upper bounds for the pallet loading problem
cites work: Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Lagrangean relaxation with clusters for point-feature cartographic label placement problems
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Q3145799
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
cites work: A fast algorithm for the maximum clique problem
cites work: A branch-and-price approach for the maximum weight independent set problem
cites work: Q4527181
cites work: A fast algorithm for coloring Meyniel graphs
cites work: Q3798257
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Q3994799
cites work: Solving the maximum clique problem using a tabu search approach
cites work: Q4040299
cites work: Lagrangean/surrogate relaxation for generalized assignment problems
cites work: The traveling-salesman problem and minimum spanning trees: Part II
DOI: 10.1016/J.COR.2005.10.008
description: scientific article; zbMATH DE number 5142329