Pages that link to "Item:Q3114706"
From MaRDI portal
The following pages link to A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem (Q3114706):
Displaying 32 items.
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
- Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
- An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- A new dynamic programming procedure for three-staged cutting patterns (Q1941034) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings (Q2295861) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns (Q2811482) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- A nested column generation algorithm to the meta slab allocation problem in the steel making industry (Q3055414) (← links)
- Analysis of distributed genetic algorithms for solving cutting problems (Q3422369) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
- The two-dimensional cutting stock problem within the roller blind production process (Q6573721) (← links)