A Hybrid Optimization Framework for Cutting and Packing Problems

DOI10.1007/978-3-540-70807-0_6zbMath1159.90477OpenAlexW1837990738MaRDI QIDQ3625009

André L. V. Coelho, Placido Rogerio Pinheiro, Napoleão Nepomuceno

Publication date: 7 May 2009

Published in: Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70807-0_6

zbMATH Keywords

combinatorial optimizationhybrid methodscutting and packing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (4)

Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization ⋮ Scalability Analysis of a Novel Integer Programming Model to Deal with Energy Consumption in Heterogeneous Wireless Sensor Networks ⋮ A Novel Optimization in Guillotine Cut Applied Reel of Steel ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes

Uses Software

• LINGO

This page was built for publication: A Hybrid Optimization Framework for Cutting and Packing Problems