The following pages link to (Q4398379):
Displayed 45 items.
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- Decomposition algorithm for geometric objects in 2D packing and cutting problems (Q464977) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- Covering a polygonal region by rectangles (Q538294) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- Cutting optimization of structural tubes to build agricultural light aircrafts (Q839788) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- Interval estimation of alternatives in decision-making problems (Q1040380) (← links)
- Cube packing. (Q1401310) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- An efficient approach for the multi-pallet loading problem (Q1569940) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- The load planning problem for double-stack intermodal trains (Q1754216) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- Mathematical modeling of interactions of primary geometric 3D objects (Q2508764) (← links)
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Optimising the cutting of wood fibre plates in the hardboard industry (Q2643972) (← links)
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)