An LP-based approach to a two-stage cutting stock problem

From MaRDI portal
Publication:1127213

DOI10.1016/0377-2217(95)00024-KzbMath0912.90241OpenAlexW2106733469MaRDI QIDQ1127213

A. J. Guimarães Rodrigues, José M. 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




Related Items (20)

Reel and sheet cutting at a paper millThe one dimensional Compartmentalised Knapsack problem: a case studyCombined cutting stock and lot-sizing problem with pattern setupA strong integer linear optimization model to the compartmentalized knapsack problemProgressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock ProblemThe constrained compartmentalized knapsack problem: mathematical models and solution methodsAn iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problemA combined cutting-stock and lot-sizing problemA coupling cutting stock-lot sizing problem in the paper industryA heuristic for the problem of one-dimensional steel coil cuttingAn exact model for a slitting problem in the steel industryOn Guillotine Separability of Squares and Rectangles.An exact algorithm for the knapsack sharing problemIntegrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its applicationA nested column generation algorithm to the meta slab allocation problem in the steel making industryAlgorithms for the one-dimensional two-stage cutting stock problemSensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problemUnbounded knapsack problem: Dynamic programming revisitedModeling multistage cutting stock problemsRow and column generation technique for a multistage cutting stock problem



Cites Work


This page was built for publication: An LP-based approach to a two-stage cutting stock problem