Worst-case analysis of maximal dual feasible functions
From MaRDI portal
Publication:1926616
DOI10.1007/s11590-011-0359-2zbMath1281.90027OpenAlexW2047398422MaRDI QIDQ1926616
Cláudio Alves, Jürgen Rietz, José M. Valério de Carvalho
Publication date: 28 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0359-2
Related Items (2)
Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ Constructing general dual-feasible functions
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of dual-feasible and superadditive functions
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Theoretical investigations on maximal dual feasible functions
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- Valid inequalities based on simple mixed-integer sets
- A Linear Programming Approach to the Cutting-Stock Problem
- 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: Worst-case analysis of maximal dual feasible functions
