Pages that link to "Item:Q1388926"
From MaRDI portal
The following pages link to An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926):
Displaying 50 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- An algorithm for the two-dimensional assortment problem (Q759646) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← links)
- An and-or-graph approach for two-dimensional cutting problems (Q1194741) (← links)
- A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- An algorithm for the 2D guillotine cutting stock problem (Q1309924) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- An improved version of Wang's algorithm for two-dimensional cutting problems (Q1825758) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems (Q1871643) (← links)
- MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Heuristics for packing semifluids (Q2286867) (← links)
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← 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 tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
- Two dimensional guillotine cutting stock and scheduling problem in printing industry (Q2676408) (← links)
- MPQ-trees for orthogonal packing problem (Q2883589) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
