Relaxations and exact solution of the variable sized bin packing problem (Q535302): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating column generation for variable sized bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the subset sum algorithm for bin packing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with divisible item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the variable size bin packing problem with discretized formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the identical parallel machine‐scheduling problem: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the variable sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for packing and scheduling problems. (Abstract of thesis) / 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: The two-dimensional bin packing problem with variable bin sizes and costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweep-based algorithm for the fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the FFH algorithm for online variable-sized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank

Latest revision as of 01:40, 4 July 2024

scientific article
Language Label Description Also known as
English
Relaxations and exact solution of the variable sized bin packing problem
scientific article

    Statements

    Relaxations and exact solution of the variable sized bin packing problem (English)
    0 references
    0 references
    0 references
    11 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    bin packing problem
    0 references
    lower bounds
    0 references
    branch-and-bound
    0 references
    0 references