Bin covering with cardinality constraints (Q2446840): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On-line and off-line approximation algorithms for vector covering problems / rank
 
Normal rank
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: Algorithms for on-line bin-packing problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using fast matrix multiplication to find basic solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for ordered vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for a dual version of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Packing with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic fully polynomial time approximation scheme for bin covering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality constrained bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple on-line bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no asymptotic PTAS for two-dimensional vector packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank

Latest revision as of 11:03, 8 July 2024

scientific article
Language Label Description Also known as
English
Bin covering with cardinality constraints
scientific article

    Statements

    Bin covering with cardinality constraints (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bin packing
    0 references
    approximation scheme
    0 references
    online algorithms
    0 references
    0 references