The multiple container loading cost minimization problem (Q635154): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2011.04.017 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Packlib2 / 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.ejor.2011.04.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998992748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loading Multiple Pallets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for multiple container loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Container loading with multi-drop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Point-Based Heuristics for Three-Dimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving container loading problems by block arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bottleneck assignment approach to the multiple container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search for the Three-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: PackLib\(^{2}\): an integrated library of multi-dimensional packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exhaustive approaches to 2D rectangular perfect packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the three-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Dimensional Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The G4-Heuristic for the Pallet Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approach for the multi-pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2011.04.017 / rank
 
Normal rank

Latest revision as of 23:15, 9 December 2024

scientific article
Language Label Description Also known as
English
The multiple container loading cost minimization problem
scientific article

    Statements

    The multiple container loading cost minimization problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 August 2011
    0 references
    packing
    0 references
    heuristics
    0 references
    container loading
    0 references
    integer programming
    0 references
    design of experiments
    0 references
    0 references
    0 references

    Identifiers