Theoretical investigations on maximal dual feasible functions
From MaRDI portal
Publication:974987
DOI10.1016/j.orl.2010.01.002zbMath1192.90127OpenAlexW2085773686MaRDI QIDQ974987
Cláudio Alves, Jürgen Rietz, José M. Valério de Carvalho
Publication date: 8 June 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.01.002
Related Items (6)
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem ⋮ Worst-case analysis of maximal dual feasible functions ⋮ Conservative scales in packing problems ⋮ On the extremality of maximal dual feasible functions ⋮ Constructing general dual-feasible functions ⋮ Exact solution techniques for two-dimensional cutting and packing
Cites Work
- Unnamed Item
- Unnamed Item
- Computing redundant resources for the resource constrained project scheduling problem
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- New Stabilization Procedures for the Cutting Stock Problem
- `` Strong NP-Completeness Results
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- New classes of fast lower bounds for bin packing problems
This page was built for publication: Theoretical investigations on maximal dual feasible functions