Pages that link to "Item:Q1825768"
From MaRDI portal
The following pages link to Optimal solutions for the cutting stock problem (Q1825768):
Displaying 50 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Enforcing minimum run length in the cutting stock problem (Q817568) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
- Near-optimal solutions to one-dimensional cutting stock problems (Q1091269) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- Establishing the optimality of sequencing heuristics for cutting stock problems (Q1127215) (← links)
- Cutting stock problems and solution procedures (Q1178994) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) (← links)
- Determining cutting stock patterns when defects are present (Q1270617) (← links)
- Solving a two-dimensional trim-loss with MILP (Q1291689) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- A search strategy for the one-size assortment problem (Q1330558) (← links)
- Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
- Solving a cutting problem based on existing patterns (Q1333483) (← links)
- An interactive technique for the cutting stock problem with multiple objectives (Q1342019) (← links)
- On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
- Cost optimization for the slitting of core laminations for power transformers (Q1357779) (← links)
- A method for the cutting stock problem with different qualities (Q1388928) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- Application of optimization for solving a sawing stock problem with a cant sawing pattern (Q1634783) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
- Wastage reduction in wood cutting (Q1820679) (← links)
- Approximation solutions for the cutting stock `portfolio' problem (Q1825733) (← links)
- Knowledge-based systems for cutting stock problems (Q1825760) (← links)
- An LP-based approach to cutting stock problems with multiple objectives (Q1825766) (← links)
- Optimal solutions for the cutting stock problem (Q1825768) (← links)
- A genetic algorithm solution for one-dimensional bundled stock cutting (Q1847176) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Mathematical modeling and optimal blank generation in glass manufacturing (Q2336874) (← links)
- Roll assortment optimization in a paper mill: an integer programming approach (Q2384912) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results (Q2884549) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- The generalized assortment and best cutting stock length problems (Q3002687) (← links)
- Solving a bi-criterion cutting stock problem with open-ended demand: a case study (Q3156669) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem (Q3394020) (← links)
- Order Allocation for Stock Cutting in the Paper Industry (Q3635095) (← links)
