Pages that link to "Item:Q4018161"
From MaRDI portal
The following pages link to Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography (Q4018161):
Displayed 50 items.
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← 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)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- A multi-objective programming approach to 1.5-dimensional assortment problem (Q858415) (← links)
- Simplest optimal cutting patterns for equal rectangles (Q867922) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Translational packing of arbitrary polytopes (Q1005325) (← 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)
- A sequential heuristic procedure for one-dimensional cutting (Q1124716) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
- Packing problems (Q1197916) (← 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)
- Computing closely matching upper and lower bounds on textile nesting problems (Q1296780) (← links)
- 4-block heuristic for the rectangle packing problem (Q1296784) (← links)
- A search strategy for the one-size assortment problem (Q1330558) (← links)
- Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
- Optimization of roll cutting in clothing industry (Q1366704) (← 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)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- Densest translational lattice packing of non-convex polygons (Q1602949) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- A simulated annealing approach to the nesting problem in the textile manufacturing industry (Q1897378) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- An exact model for a slitting problem in the steel industry (Q2239876) (← links)
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (Q2242390) (← links)
- Mathematical modeling and optimal blank generation in glass manufacturing (Q2336874) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- Dynamic programming algorithms for the optimal cutting of equal rectangles (Q2504483) (← links)