A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension (Q2669688): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Port space allocation with a time dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving decision rules to locate export containers in container yards / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical-shaking neighborhood search for the yard allocation 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 column generation heuristic for a dynamic generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A skyline heuristic for the 2D rectangular packing and strip packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional bin packing problem with variable bin height / rank
 
Normal rank

Latest revision as of 05:42, 28 July 2024

scientific article
Language Label Description Also known as
English
A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension
scientific article

    Statements

    Identifiers