Pages that link to "Item:Q421662"
From MaRDI portal
The following pages link to A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662):
Displayed 22 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension (Q2669688) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) (← links)
- Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Dual-neighborhood iterated local search for routing and wavelength assignment (Q6068726) (← links)
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints (Q6106775) (← links)