Heuristics for the integer one-dimensional cutting stock problem: A computational study
From MaRDI portal
Recommendations
Cites work
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Linear Programming Approach to the Cutting Stock Problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- A typology of cutting and packing problems
- An instance of the cutting stock problem for which the rounding property does not hold
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1094755 (Why is no real title available?)
- scientific article; zbMATH DE number 274399 (Why is no real title available?)
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Cited in
(70)- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- An inexact bundle variant suited to column generation
- Two heuristics for the one-dimensional bin-packing problem
- The one-dimensional cutting stock problem with usable leftover - a heuristic approach
- Near-optimal solutions to one-dimensional cutting stock problems
- A simulated annealing heuristic for the one-dimensional cutting stock problem
- Random search in the one-dimensional cutting stock problem
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Evaluation of algorithms for one-dimensional cutting
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- BPPLIB: a library for bin packing and cutting stock problems
- A genetic algorithm solution for one-dimensional bundled stock cutting
- LP models for bin packing and cutting stock problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
- Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods
- A heuristic for the problem of one-dimensional steel coil cutting
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Characterizing the optimality gap and the optimal packings for the bin packing problem
- New symmetry-less ILP formulation for the classical one dimensional bin-packing problem
- Solving bin packing problems using VRPSolver models
- Modified greedy heuristic for the one-dimensional cutting stock problem
- Solving robust bin-packing problems with a branch-and-price approach
- A residual recombination heuristic for one-dimensional cutting stock problems
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- Kinetic models of conservative economies with need-based transfers as welfare
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- The one dimensional Compartmentalised Knapsack problem: a case study
- An integrated cutting stock and sequencing problem
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- The cutting stock problem
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Solution approaches for the cutting stock problem with setup cost
- Bin packing and related problems: general arc-flow formulation with graph compression
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Solving one-dimensional cutting stock problem with discrete demands and capacitated planning objective
- A new heuristic algorithm for the one-dimensional cutting stock problem
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- A Novel Optimization in Guillotine Cut Applied Reel of Steel
- scientific article; zbMATH DE number 3976756 (Why is no real title available?)
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- A simulated annealing hyper-heuristic methodology for flexible decision support
- scientific article; zbMATH DE number 1050896 (Why is no real title available?)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
- A Heuristic Solution of a Cutting Problem Using Hypergraphs
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- scientific article; zbMATH DE number 7647855 (Why is no real title available?)
- Heuristic algorithms based on column generation for an online product shipping problem
- On the cutting stock problem under stochastic demand
- A new destructive bounding scheme for the bin packing problem
- The cutting stock problem applied to the hardening process in an automotive spring factory
- Local-search based heuristics for advertisement scheduling
- Domain-independent dynamic programming
- Classification and literature review of integrated lot-sizing and cutting stock problems
- The constrained compartmentalised knapsack problem
- New bin packing fast lower bounds
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A coupling cutting stock-lot sizing problem in the paper industry
- Large gaps in one-dimensional cutting stock problems
This page was built for publication: Heuristics for the integer one-dimensional cutting stock problem: A computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919356)
