An LP-based approach to a two-stage cutting stock problem
From MaRDI portal
Publication:1127213
DOI10.1016/0377-2217(95)00024-KzbMATH Open0912.90241OpenAlexW2106733469MaRDI QIDQ1127213FDOQ1127213
Authors: A. J. Guimarães Rodrigues, José Valério de Carvalho 
Publication date: 5 November 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)00024-k
Recommendations
- A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
- Algorithms for the one-dimensional two-stage cutting stock problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- An LP-based approach to cutting stock problems with multiple objectives
column generationlarge knapsack problemsmake-to-order steel companyone-dimensional two-phase problemstwo-stage cutting stock
Cites Work
Cited In (35)
- A heuristic for the problem of one-dimensional steel coil cutting
- A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Combined cutting stock and lot-sizing problem with pattern setup
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- An exact model for a slitting problem in the steel industry
- A coupling cutting stock-lot sizing problem in the paper industry
- Algorithms for the one-dimensional two-stage cutting stock problem
- Application of column generation approach in minimizing waste and predicting future inventory of one dimensional cutting stock problem
- Row and column generation technique for a multistage cutting stock problem
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem
- A nested column generation algorithm to the meta slab allocation problem in the steel making industry
- A combined cutting-stock and lot-sizing problem
- LP models for bin packing and cutting stock problems
- A two-phase roll cutting problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Reel and sheet cutting at a paper mill
- On Guillotine Separability of Squares and Rectangles.
- Title not available (Why is that?)
- An LP-based approach to cutting stock problems with multiple objectives
- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
- Unbounded knapsack problem: Dynamic programming revisited
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- The one dimensional Compartmentalised Knapsack problem: a case study
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
- A strong integer linear optimization model to the compartmentalized knapsack problem
- Bethlehem steel combines cutting stock and set covering to enhance customer service
- An exact algorithm for the knapsack sharing problem
- Modeling multistage cutting stock problems
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Two-Stage Cutting Stock Problem with Due Dates
This page was built for publication: An LP-based approach to a two-stage cutting stock problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127213)
