Heuristics for the integer one-dimensional cutting stock problem: A computational study
From MaRDI portal
Publication:1919356
DOI10.1007/BF01539705zbMath0853.90099MaRDI QIDQ1919356
Publication date: 13 October 1996
Published in: OR Spektrum (Search for Journal in Brave)
Related Items (53)
Families of non-IRUP instances of the one-dimensional cutting stock problem ⋮ A residual recombination heuristic for one-dimensional cutting stock problems ⋮ Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An improved typology of cutting and packing problems ⋮ The one dimensional Compartmentalised Knapsack problem: a case study ⋮ An integrated cutting stock and sequencing problem ⋮ 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 ⋮ An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ The constrained compartmentalised knapsack problem ⋮ Kinetic models of conservative economies with need-based transfers as welfare ⋮ New bin packing fast lower bounds ⋮ On the cutting stock problem under stochastic demand ⋮ A new destructive bounding scheme for the bin packing problem ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ The cutting stock problem applied to the hardening process in an automotive spring factory ⋮ A simulated annealing hyper-heuristic methodology for flexible decision support ⋮ 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 ⋮ Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods ⋮ Large gaps in one-dimensional cutting stock problems ⋮ Solving the one-dimensional bin packing problem with a weight annealing heuristic ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ A Heuristic Solution of a Cutting Problem Using Hypergraphs ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ 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 ⋮ 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 ⋮ A note on linear models for two-group and three-group two-dimensional guillotine cutting problems ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Solving bin packing problems using VRPSolver models ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ A Novel Optimization in Guillotine Cut Applied Reel of Steel ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem ⋮ An inexact bundle variant suited to column generation ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ Two heuristics for the one-dimensional bin-packing problem ⋮ Solving robust bin-packing problems with a branch-and-price approach ⋮ The one-dimensional cutting stock problem with usable leftover - a heuristic approach ⋮ Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem ⋮ 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 ⋮ Simulated annealing for order spread minimization in sequencing cutting patterns ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting ⋮ Evaluation of algorithms for one-dimensional cutting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An instance of the cutting stock problem for which the rounding property does not hold
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- 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
- A New Linear Programming Approach to the Cutting Stock Problem
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: Heuristics for the integer one-dimensional cutting stock problem: A computational study
