CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
From MaRDI portal
Publication:1127211
DOI10.1016/0377-2217(95)00023-JzbMath0918.90117OpenAlexW2047173886MaRDI QIDQ1127211
Publication date: 13 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00023-j
Related Items
A residual recombination heuristic for one-dimensional cutting stock problems, Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem, An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems, A branch-and-price-and-cut algorithm for the pattern minimization problem, 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems, Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost, Integer linear programming models for the skiving stock problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, Bin packing and related problems: general arc-flow formulation with graph compression, In situ column generation for a cutting-stock problem, One-dimensional stock cutting: optimization of usable leftovers in consecutive orders, Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost, Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Heuristics for the integer one-dimensional cutting stock problem: A computational study, The modified integer round-up property of the one-dimensional cutting stock problem, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, On the cutting stock problem under stochastic demand, A survey of dual-feasible and superadditive functions, Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries, A strong integer linear optimization model to the compartmentalized knapsack problem, An integer linear optimization model to the compartmentalized knapsack problem, Facets of a mixed-integer bilinear covering set with bounds on variables, Dantzig-Wolfe decomposition and branch-and-price solving in G12, Cutting stock with no three parts per pattern: work-in-process and pattern minimization, On the one-dimensional stock cutting problem in the paper tube industry, On the facet defining inequalities of the mixed-integer bilinear covering set, Improving competitiveness in veneers production by a simple-to-use DSS., From High-Level Model to Branch-and-Price Solution in G12, On LP relaxations for the pattern minimization problem, BPPLIB: a library for bin packing and cutting stock problems, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems, Comparison of bundle and classical column generation, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP, A hybrid heuristic to reduce the number of different patterns in cutting stock problems, A combined approach to the solution to the general one-dimensional cutting stock problem, One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects, Modified greedy heuristic for the one-dimensional cutting stock problem, A hybrid approach for optimization of one-dimensional cutting, An inexact bundle variant suited to column generation, CUTGEN1, New lower bounds based on column generation and constraint programming for the pattern minimization problem, Simulated annealing for order spread minimization in sequencing cutting patterns, Evaluation of algorithms for one-dimensional cutting, One-dimensional cutting stock problem to minimize the number of different patterns, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
Cites Work
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- A typology of cutting and packing problems
- Mathematical Methods of Organizing and Planning Production
- A Linear Programming Approach to the Cutting-Stock Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- A More Portable Fortran Random Number Generator
- A new uniform pseudorandom number generator
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
