Algorithms for the one-dimensional two-stage cutting stock problem
From MaRDI portal
Publication:724047
DOI10.1016/j.ejor.2018.04.042zbMath1403.90583OpenAlexW2800285872WikidataQ129915245 ScholiaQ129915245MaRDI QIDQ724047
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.042
Related Items (3)
Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach
Cites Work
- Unnamed Item
- Unnamed Item
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- The constrained compartmentalised knapsack problem
- Computational study of large-scale \(p\)-median problems
- 0-1 reformulations of the multicommodity capacitated network design problem
- An LP-based approach to a two-stage cutting stock problem
- Bounds for nested knapsack problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Row and column generation technique for a multistage cutting stock problem
- A two-phase roll cutting problem
- A typology of cutting and packing problems
- LP models for bin packing and cutting stock problems
- Modeling multistage cutting stock problems
- A note on ``A LP-based heuristic for a time-constrained routing problem
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- A LP-based heuristic for a time-constrained routing problem
- An improved typology of cutting and packing problems
- The one dimensional Compartmentalised Knapsack problem: a case study
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
- The knapsack problem with a minimum filling constraint
- A Linear Programming Approach to the Cutting-Stock Problem
- Computing Partitions with Applications to the Knapsack Problem
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Shortest Path Problems with Resource Constraints
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
This page was built for publication: Algorithms for the one-dimensional two-stage cutting stock problem
