Vector bin packing with multiple-choice (Q427903): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2012.02.020 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.02.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2800347522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for some generalized knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multidimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with controllable item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An APTAS for Generalized Cost Variable-Sized Bin Packing / 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: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple-choice multidimensional knapsack problem / 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: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximation Scheme for Variable-Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Variable-Sized Online Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2012.02.020 / rank
 
Normal rank

Latest revision as of 17:17, 9 December 2024

scientific article
Language Label Description Also known as
English
Vector bin packing with multiple-choice
scientific article

    Statements

    Vector bin packing with multiple-choice (English)
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    approximation algorithms
    0 references
    multiple-choice vector bin packing
    0 references
    multiple-choice multidimensional knapsack
    0 references
    0 references
    0 references

    Identifiers