A new iterative-doubling greedy-lookahead algorithm for the single container loading problem (Q1926951): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986685337 / 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: Loading Multiple Pallets / 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: The multiple container loading cost minimization 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: Solving container loading problems by block arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tree Search Algorithm for Solving the Container Loading Problem / 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: An efficient placement heuristic for three-dimensional rectangular packing / 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: A parallel hybrid local search algorithm for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack 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: A Maximal-Space Algorithm for the Container Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allowing for weight considerations in container loading / 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 / cites work
 
Property / cites work: An effective quasi-human based heuristic for solving the rectangle packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP / rank
 
Normal rank

Latest revision as of 01:34, 6 July 2024

scientific article
Language Label Description Also known as
English
A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
scientific article

    Statements

    A new iterative-doubling greedy-lookahead algorithm for the single container loading problem (English)
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    packing
    0 references
    3D packing
    0 references
    block building
    0 references
    tree search
    0 references
    0 references