Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
From MaRDI portal
Publication:297181
DOI10.1016/j.ejor.2013.08.011zbMath1339.90235OpenAlexW1977716442MaRDI QIDQ297181
François Clautiaux, Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.011
Related Items (10)
A single machine scheduling problem with two-dimensional vector packing constraints ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ Single workgroup scheduling problem with variable processing personnel ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem ⋮ A branch-and-price algorithm for the temporal bin packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- There is no asymptotic PTAS for two-dimensional vector packing
- A survey of dual-feasible and superadditive functions
- 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
- Theoretical investigations on maximal dual feasible functions
- Bin packing can be solved within 1+epsilon in linear time
- Resource constrained scheduling as generalized bin packing
- Properties of some ILP formulations of a class of partitioning problems
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- A two-dimensional vector packing model for the efficient use of coil cassettes
- Mathematical Methods of Organizing and Planning Production
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- New Algorithms for Bin Packing
- `` Strong NP-Completeness Results
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- New classes of fast lower bounds for bin packing problems
This page was built for publication: Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
