Pages that link to "Item:Q2654387"
From MaRDI portal
The following pages link to Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387):
Displayed 32 items.
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Heuristics for packing semifluids (Q2286867) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
- Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)