Lower bounds and algorithms for the minimum cardinality bin covering problem
type: Item
instance of: scholarly article
title: Lower bounds and algorithms for the minimum cardinality bin covering problem
zbMATH Open document ID: 1394.90502
author: Rico Walter
author: Alexander Lawrinenko
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6872214
zbMATH Keywords: bin covering
zbMATH Keywords: minimum cardinality
zbMATH Keywords: lower bounds
zbMATH Keywords: heuristics
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.06.068
OpenAlex ID: W2465515034
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Integer Rounding for Polymatroid and Branching Optimization Problems
cites work: Probabilistic bounds for dual bin-packing
cites work: Using extra dual cuts to accelerate column generation
cites work: Q3048582
cites work: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
cites work: Bin packing: Maximizing the number of pieces packed
cites work: On the sum minimization version of the online bin covering problem
cites work: Two simple algorithms for bin covering
cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
cites work: Class constrained bin covering
cites work: Bin covering with cardinality constraints
cites work: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
cites work: Probabilistic analysis of a heuristic for the dual bin packing problem
cites work: Q3624058
cites work: Q4198056
cites work: Maximizing the minimum completion time on parallel machines
cites work: Approximating covering integer programs with multiplicity constraints
cites work: Approximation algorithms for covering/packing integer programs
cites work: An exact algorithm for the dual bin packing problem
cites work: Upper bounds and algorithms for the maximum cardinality bin packing problem.
cites work: Performance of Heuristics for a Computer Resource Allocation Problem
cites work: Selected Topics in Column Generation
cites work: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
cites work: Dual bin packing with items of random sizes
cites work: The modified integer round-up property of the one-dimensional cutting stock problem
cites work: Improved Approximation Guarantees for Packing and Covering Integer Programs
cites work: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
DOI: 10.1016/J.EJOR.2016.06.068
description: scientific article; zbMATH DE number 6872214