Lower bounds for a bin packing problem with linear usage cost (Q1755229): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2018.10.004 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2897983212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures / 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: On the generalized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of lower bound procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the asymptotic worst-case of bin packing lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks for mean flow time criterion / 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 with general cost structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solution of open bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations and exact solution of the variable sized bin packing problem / 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: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalized bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin‐packing problem with concave costs of bin utilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing 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: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129037857 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2018.10.004 / rank
 
Normal rank

Latest revision as of 08:30, 11 December 2024

scientific article
Language Label Description Also known as
English
Lower bounds for a bin packing problem with linear usage cost
scientific article

    Statements

    Lower bounds for a bin packing problem with linear usage cost (English)
    0 references
    0 references
    9 January 2019
    0 references
    packing
    0 references
    combinatorial optimization
    0 references
    lower bounds
    0 references
    performance ratio
    0 references
    branch and bound
    0 references

    Identifiers