Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bounds for dual bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing: Maximizing the number of pieces packed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum minimization version of the online bin covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class constrained bin covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin covering with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a heuristic for the dual bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum completion time on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating covering integer programs with multiplicity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for covering/packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the dual bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and algorithms for the maximum cardinality bin packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of Heuristics for a Computer Resource Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual bin packing with items of random sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified integer round-up property of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees for Packing and Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital / rank
 
Normal rank

Latest revision as of 17:11, 15 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds and algorithms for the minimum cardinality bin covering problem
scientific article

    Statements

    Lower bounds and algorithms for the minimum cardinality bin covering problem (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bin covering
    0 references
    minimum cardinality
    0 references
    lower bounds
    0 references
    heuristics
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references