Pages that link to "Item:Q1825761"
From MaRDI portal
The following pages link to A typology of cutting and packing problems (Q1825761):
Displaying 50 items.
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach (Q930941) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming (Q992591) (← links)
- Sequencing mixed-model assembly lines: survey, classification and model critique (Q1011163) (← links)
- The stochastic trim-loss problem (Q1011257) (← 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)
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- A sequential heuristic procedure for one-dimensional cutting (Q1124716) (← links)
- Regular packing of congruent polygons on the rectangular sheet (Q1124824) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
- An LP-based approach to a two-stage cutting stock problem (Q1127213) (← links)
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← links)
- Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
- Guillotineable bin packing: A genetic approach (Q1127222) (← links)
- How to use structural constraints to compute an upper bound for the pallet loading problem (Q1127224) (← links)
- Loading plates with non-identical items (Q1127227) (← links)
- An analytical model for the container loading problem (Q1129950) (← links)
- Nesting planning based on production priorities and technological efficiency (Q1129962) (← links)
- Bounds for nested knapsack problems (Q1130040) (← links)
- Cutting stock problems and solution procedures (Q1178994) (← links)
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders) (Q1182227) (← links)
- Solving sequential interval cutting problems via dynamic programming (Q1197666) (← links)
- Packing problems (Q1197916) (← links)
- Solution for the constrained Guillotine cutting problem by simulated annealing (Q1265860) (← links)
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem (Q1268250) (← links)
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands (Q1278246) (← links)
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach (Q1278342) (← links)
- Setup minimising conditions in the trim loss problem (Q1278430) (← links)
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373) (← links)
- 4-block heuristic for the rectangle packing problem (Q1296784) (← links)
- An exact depth-first algorithm for the pallet loading problem (Q1303552) (← links)
- Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
- Integrated container loading software for pulp and paper industry (Q1333536) (← links)
- An interactive technique for the cutting stock problem with multiple objectives (Q1342019) (← links)
- On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
- Optimization of roll cutting in clothing industry (Q1366704) (← links)
- Palletisation efficiency as a criterion for product design (Q1374394) (← links)
- Allowing for weight considerations in container loading (Q1384228) (← links)
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- The cutting stock problem in a hardboard industry: A case study. (Q1406647) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- Improving competitiveness in veneers production by a simple-to-use DSS. (Q1426707) (← links)
