A survey of dual-feasible and superadditive functions
From MaRDI portal
Publication:610986
DOI10.1007/s10479-008-0453-8zbMath1229.90155OpenAlexW2005431820MaRDI QIDQ610986
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0453-8
Related Items (25)
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem ⋮ Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems ⋮ Procedures for the bin packing problem with precedence constraints ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ Exact algorithms for the bin packing problem with fragile objects ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Worst-case analysis of maximal dual feasible functions ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Conservative scales in packing problems ⋮ On the extremality of maximal dual feasible functions ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ A lexicographic pricer for the fractional bin packing problem ⋮ Projective Cutting-Planes ⋮ New lower bounds based on column generation and constraint programming for the pattern minimization problem ⋮ Friendly bin packing instances without integer round-up property
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- 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
- Bidimensional packing by bilinear programming
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- On linear lower bounds for the resource constrained project scheduling problem.
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- A new LP-based lower bound for the cumulative scheduling problem
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- New lower bounds for the three-dimensional finite bin packing problem
- Edmonds polytopes and a hierarchy of combinatorial problems
- Valid inequalities based on simple mixed-integer sets
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- Outline of an algorithm for integer solutions to linear programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- New classes of fast lower bounds for bin packing problems
This page was built for publication: A survey of dual-feasible and superadditive functions
