Pages that link to "Item:Q5952054"
From MaRDI portal
The following pages link to Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems (Q5952054):
Displaying 29 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems (Q604802) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← 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)
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Algorithms for the constrained two-staged two-dimensional cutting problem (Q2901006) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems (Q3605433) (← links)
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais (Q3621505) (← links)
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems (Q4272900) (← links)
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem (Q4596237) (← links)
- Linear models for 1-group two-dimensional guillotine cutting problems (Q5485054) (← 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)
- The two-dimensional cutting stock problem within the roller blind production process (Q6573721) (← links)
