Pages that link to "Item:Q1806892"
From MaRDI portal
The following pages link to Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892):
Displaying 28 items.
- A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints (Q2356020) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- A 3-approximation algorithm for two-dimensional bin packing (Q2488211) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Metaheuristics for truck loading in the car production industry (Q2968504) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization (Q5438610) (← links)
- A fast algorithm for two-dimensional pallet loading problems of large size (Q5945208) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
