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 fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576) (← links)
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- 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 efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← 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)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts (Q339606) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- Trim loss optimization by an improved differential evolution (Q474531) (← links)
- Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
- Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
- A novel hybrid tabu search approach to container loading (Q613519) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts (Q632697) (← links)
- Rectangle packing with additional restrictions (Q650936) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
- Stability aspects of pallet loading (Q807333) (← links)
- Software zur Verpackungslogistik. Übersicht und Vergleich. (Software for the logistics of packing) (Q807339) (← links)
- Enforcing minimum run length in the cutting stock problem (Q817568) (← links)
- Cutting optimization of structural tubes to build agricultural light aircrafts (Q839788) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← 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)
- One-dimensional cutting stock optimization in consecutive time periods (Q858441) (← links)
- Simplest optimal cutting patterns for equal rectangles (Q867922) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Cut scheduling in the apparel industry (Q883280) (← links)
- Layer-layout-based heuristics for loading homogeneous items into a single container (Q926048) (← links)
