Efficient algorithms for the offline variable sized bin-packing problem (Q2434654): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Bison / 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.1007/s10898-012-9989-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975570210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for determining the number of warehouses for storing non-compatible products / 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: Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms / 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: The Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for one-dimensional bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the variable sized bin-packing problem / 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: Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / 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: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint / 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

Latest revision as of 08:46, 7 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for the offline variable sized bin-packing problem
scientific article

    Statements

    Efficient algorithms for the offline variable sized bin-packing problem (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2014
    0 references
    0 references
    bin-packing problem
    0 references
    heuristics
    0 references
    monotonicity constraint
    0 references
    0 references