Pages that link to "Item:Q1127211"
From MaRDI portal
The following pages link to CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211):
Displayed 50 items.
- CUTGEN1 (Q26729) (← links)
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost (Q319143) (← links)
- Integer linear programming models for the skiving stock problem (Q322686) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
- Simulated annealing for order spread minimization in sequencing cutting patterns (Q1303575) (← links)
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
- Improving competitiveness in veneers production by a simple-to-use DSS. (Q1426707) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
- A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (Q2242390) (← links)
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (Q2401325) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Dantzig-Wolfe decomposition and branch-and-price solving in G12 (Q2430361) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems (Q2489315) (← links)
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
- On LP relaxations for the pattern minimization problem (Q3008919) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995) (← links)
- From High-Level Model to Branch-and-Price Solution in G12 (Q5387632) (← links)
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries (Q6048506) (← links)
- A strong integer linear optimization model to the compartmentalized knapsack problem (Q6088168) (← links)
- An integer linear optimization model to the compartmentalized knapsack problem (Q6088172) (← links)