Pages that link to "Item:Q1403304"
From MaRDI portal
The following pages link to Local search algorithms for the rectangle packing problem with general spatial costs (Q1403304):
Displaying 12 items.
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- Optimizing yard assignment in an automotive transshipment terminal (Q421631) (← links)
- Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
- Scheduling under the network of temporo-spatial proximity relationships (Q1652320) (← links)
- Berth management in container terminal: the template design problem (Q2432094) (← links)
- Operations research at container terminals: a literature update (Q2480797) (← links)
- Improved local search algorithms for the rectangle packing problem with general spatial costs (Q2484340) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- A personal perspective on problem solving by general purpose solvers (Q3566446) (← links)