The following pages link to Packing problems (Q1197916):
Displaying 50 items.
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning (Q1042176) (← links)
- Regular packing of congruent polygons on the rectangular sheet (Q1124824) (← links)
- Solution approaches to irregular nesting problems (Q1127203) (← links)
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← links)
- Packing different-sized circles into a rectangular container (Q1127229) (← links)
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem (Q1268250) (← links)
- A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← links)
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach (Q1278342) (← links)
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373) (← links)
- An algorithm of global optimization for solving layout problems (Q1296379) (← links)
- Computing closely matching upper and lower bounds on textile nesting problems (Q1296780) (← links)
- Integrated defect detection and optimization for cross cutting of wooden boards (Q1296782) (← links)
- 4-block heuristic for the rectangle packing problem (Q1296784) (← links)
- An exact depth-first algorithm for the pallet loading problem (Q1303552) (← links)
- Integrated container loading software for pulp and paper industry (Q1333536) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- Effective methods for a container packing operation (Q1361222) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- The cutting stock problem in a hardboard industry: A case study. (Q1406647) (← links)
- Managing uncertainty in orthopaedic trauma theatres. (Q1420444) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- An efficient approach for the multi-pallet loading problem (Q1569940) (← links)
- Densest translational lattice packing of non-convex polygons (Q1602949) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
- The load planning problem for double-stack intermodal trains (Q1754216) (← links)
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles (Q1806919) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
