Lower bounds and algorithms for the minimum cardinality bin covering problem
From MaRDI portal
Publication:1752204
DOI10.1016/j.ejor.2016.06.068zbMath1394.90502OpenAlexW2465515034MaRDI QIDQ1752204
Rico Walter, Alexander Lawrinenko
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.06.068
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Cites Work
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- Class constrained bin covering
- On the sum minimization version of the online bin covering problem
- Maximizing the minimum completion time on parallel machines
- Probabilistic bounds for dual bin-packing
- The modified integer round-up property of the one-dimensional cutting stock problem
- Bin packing: Maximizing the number of pieces packed
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- Approximating covering integer programs with multiplicity constraints
- Dual bin packing with items of random sizes
- Probabilistic analysis of a heuristic for the dual bin packing problem
- An exact algorithm for the dual bin packing problem
- A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
- Bin covering with cardinality constraints
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Approximation algorithms for covering/packing integer programs
- Using Extra Dual Cuts to Accelerate Column Generation
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
- On a dual version of the one-dimensional bin packing problem
- Performance of Heuristics for a Computer Resource Allocation Problem
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- Selected Topics in Column Generation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
