A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Maurizio Boccia / rank
Normal rank
 
Property / author
 
Property / author: Aantonio Sforza / rank
Normal rank
 
Property / author
 
Property / author: Maurizio Boccia / rank
 
Normal rank
Property / author
 
Property / author: Aantonio Sforza / 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/s10288-010-0133-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050975710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional packing of items with limited load bearing strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for weakly heterogeneous container loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical model for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight distribution considerations in container loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic approaches for the two- and three-dimensional knapsack packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PACKING A TRUCK — NOW WITH A TWIST! / 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: Q4452991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MIP approach for some practical packing problems: balancing constraints and tetris-like items / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP-based heuristic for non-standard 3D-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Genetic Algorithm for Solving the Container Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Genetic Algorithm for Solving the Container Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Container Packing for a Single Size of Box / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic algorithm for cuboids packing with no orientation constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing small boxes into a big box. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Maximal-Space Algorithm for the Container Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood structures for the container loading problem: a VNS implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical modeling of interactions of primary geometric 3D objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Phi\)-functions for complex 2D-objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of a Φ-function for two convex polytopes / 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: A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:54, 4 July 2024

scientific article
Language Label Description Also known as
English
A fast heuristic for a three-dimensional non-convex domain loading problem
scientific article

    Statements

    A fast heuristic for a three-dimensional non-convex domain loading problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    3D loading
    0 references
    trunk problem
    0 references
    0 references
    0 references
    0 references
    0 references