A two-phase roll cutting problem

From MaRDI portal
Publication:1825752

DOI10.1016/0377-2217(90)90354-EzbMath0684.90048OpenAlexW2025898393MaRDI QIDQ1825752

P. Fonseca e Castro, José Soeiro Ferreira, M. António Neves

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90354-e




Related Items (23)

Approximation schemes for knapsack problems with shelf divisionsReel and sheet cutting at a paper millAn algorithm for the determination of optimal cutting patternsThe one dimensional Compartmentalised Knapsack problem: a case studyOptimization of roll cutting in clothing industryThe constrained compartmentalised knapsack problemA sequential heuristic procedure for one-dimensional cuttingAn LP-based approach to a two-stage cutting stock problemA strong integer linear optimization model to the compartmentalized knapsack problemAn integer linear optimization model to the compartmentalized knapsack problemThe constrained compartmentalized knapsack problem: mathematical models and solution methodsSimultaneous column-and-row generation for large-scale linear programs with column-dependent-rowsHeuristic methods for gang-rip saw arbor design.A heuristic for the problem of one-dimensional steel coil cuttingAn exact model for a slitting problem in the steel industryA one-dimensional bin packing problem with shelf divisionsAlgorithms for the one-dimensional two-stage cutting stock problemA note on dual approximation algorithms for class constrained bin packing problemsA hybrid approach for optimization of one-dimensional cuttingModeling multistage cutting stock problemsA column generation procedure for gang-rip saw arbor design and schedulingRow and column generation technique for a multistage cutting stock problemEvaluation of algorithms for one-dimensional cutting



Cites Work


This page was built for publication: A two-phase roll cutting problem