swMATH14833MaRDI QIDQ26729FDOQ26729
Author name not available (Why is that?)
Official website: http://www.sciencedirect.com/science/article/pii/037722179500023J
Cited In (54)
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Nonlinear cutting stock problem model to minimize the number of different patterns and objects
- An inexact bundle approach to cutting-stock problems
- Title not available (Why is that?)
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Evaluation of algorithms for one-dimensional cutting
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A hybrid approach for optimization of one-dimensional cutting
- Improving competitiveness in veneers production by a simple-to-use DSS.
- In situ column generation for a cutting-stock problem
- A residual recombination heuristic for one-dimensional cutting stock problems
- A survey of dual-feasible and superadditive functions
- On the cutting stock problem under stochastic demand
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Integer linear programming models for the skiving stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Bin packing and related problems: general arc-flow formulation with graph compression
- OPTMODEL
- libcgrpp
- SimCList
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- TTTPLOTS
- CVRPSEP
- SLOPPGEN
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- CVRPSP
- 2DCPackGen
- Bison
- Comparison of bundle and classical column generation
- BPPLIB
- Modified greedy heuristic for the one-dimensional cutting stock problem
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- On the one-dimensional stock cutting problem in the paper tube industry
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
- On LP relaxations for the pattern minimization problem
- A combined approach to the solution to the general one-dimensional cutting stock problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- An inexact bundle variant suited to column generation
- Solutions diversification in a column generation algorithm
- BPPLIB: a library for bin packing and cutting stock problems
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
- Pattern reduction in one-dimensional cutting stock problems
This page was built for software: CUTGEN1
