Pages that link to "Item:Q3392097"
From MaRDI portal
The following pages link to An Exact Algorithm for Higher-Dimensional Orthogonal Packing (Q3392097):
Displayed 11 items.
- A new heuristic algorithm for rectangle packing (Q883288) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (Q2378414) (← links)
- A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)