Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor

DOI10.1590/S0101-74382000000200005zbMath1181.90293MaRDI QIDQ5189098

Randal Farago, Reinaldo Morabito

Publication date: 6 March 2010

Published in: Pesquisa Operacional (Search for Journal in Brave)

zbMATH Keywords

subgradient optimizationLagrangean heuristicLagrangean and surrogate relaxationmanufacturers pallet loading problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Cites Work

• Unnamed Item
• Unnamed Item
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting 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
• An exact algorithm for the pallet loading problem
• A typology of cutting and packing problems
• A simple and effective recursive procedure for the manufacturer's pallet loading problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
• The G4-Heuristic for the Pallet Loading Problem

This page was built for publication: Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor