A branch-and-price-and-cut algorithm for the pattern minimization problem
RAIRO-Oper. Res., 42 4 (2008) 435-453
Published online: 2009-04-04
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Random-Key Optimizer with reinforcement learning for the Capacitated Multi-period Cutting Stock Problem with setup cost
Eduardo M. Silva, Antônio A. Chaves, Silvio A. de Araujo and Raf JansComputers & Operations Research 183 107159 (2025)
https://doi.org/10.1016/j.cor.2025.107159
OPTICUT: a new heuristic algorithm for the one-dimensional cutting stock problem with pattern minimization
Nahsen Kayhan and Esra Kurt TekezEngineering Optimization 1 (2025)
https://doi.org/10.1080/0305215X.2025.2480864
A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem
Irving Barragan-Vite, Joselito Medina-Marin, Norberto Hernandez-Romero and Gustavo Erick Anaya-FuentesApplied Sciences 14 (18) 8172 (2024)
https://doi.org/10.3390/app14188172
(2024)
https://doi.org/10.2139/ssrn.4907785
Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes
Heloisa Vasques da Silva, Felipe Kesrouani Lemos, Adriana Cristina Cherri and Silvio Alexandre de AraujoRAIRO - Operations Research 57 (1) 183 (2023)
https://doi.org/10.1051/ro/2023001
Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
Sebastian Kraul, Markus Seizinger and Jens O. BrunnerINFORMS Journal on Computing 35 (3) 692 (2023)
https://doi.org/10.1287/ijoc.2023.1277
A method for demand-accurate one-dimensional cutting problems with pattern reduction
Haihua Xiao, Qiaokang Liang, Dan Zhang, Suhua Xiao and Gangzhuo NieMathematical Biosciences and Engineering 20 (4) 7453 (2023)
https://doi.org/10.3934/mbe.2023323
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
Eduardo M. Silva, Gislaine M. Melega, Kerem Akartunalı and Silvio A. de AraujoEuropean Journal of Operational Research 304 (2) 443 (2023)
https://doi.org/10.1016/j.ejor.2022.04.023
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
Mateus Martin, Horacio Hideki Yanasse and Luiz Leduíno Salles-NetoJournal of Combinatorial Optimization 44 (1) 557 (2022)
https://doi.org/10.1007/s10878-022-00848-z
A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem
Hesham K. Alfares and Omar G. AlsawafyInternational Journal of Applied Industrial Engineering 6 (2) 1 (2019)
https://doi.org/10.4018/IJAIE.2019070101
Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
Ning Ma, Ya Liu and Zhili ZhouComputers & Operations Research 109 218 (2019)
https://doi.org/10.1016/j.cor.2019.05.013
A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem
Angelo Aliano Filho, António Carlos Moretti and Margarida Vaz PatoJournal of the Operational Research Society 69 (1) 91 (2018)
https://doi.org/10.1057/s41274-017-0214-7
A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS
Silvio Alexandre de Araujo, Kelly Cristina Poldi and Jim SmithPesquisa Operacional 34 (2) 165 (2014)
https://doi.org/10.1590/0101-7438.2014.034.02.0165
Extensions of cutting problems: setups
Sebastian Henn and Gerhard WäscherPesquisa Operacional 33 (2) 133 (2013)
https://doi.org/10.1590/S0101-74382013000200001
Solution approaches for the cutting stock problem with setup cost
Azadeh Mobasher and Ali EkiciComputers & Operations Research 40 (1) 225 (2013)
https://doi.org/10.1016/j.cor.2012.06.007
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization
Alessandro Aloisio, Claudio Arbib and Fabrizio MarinelliDiscrete Optimization 8 (2) 315 (2011)
https://doi.org/10.1016/j.disopt.2010.10.002
A survey of dual-feasible and superadditive functions
François Clautiaux, Cláudio Alves and José Valério de CarvalhoAnnals of Operations Research 179 (1) 317 (2010)
https://doi.org/10.1007/s10479-008-0453-8
Optimal job splitting on a multi‐slot machine with applications in the printing industry
Ali Ekici, Özlem Ergun, Pınar Keskinocak and Michail G. LagoudakisNaval Research Logistics (NRL) 57 (3) 237 (2010)
https://doi.org/10.1002/nav.20396
New lower bounds based on column generation and constraint programming for the pattern minimization problem
Cláudio Alves, Rita Macedo and José Valério de CarvalhoComputers & Operations Research 36 (11) 2944 (2009)
https://doi.org/10.1016/j.cor.2009.01.008