Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Alves, Cláudio
Macedo, Rita
and
Valério de Carvalho, José
2009.
New lower bounds based on column generation and constraint programming for the pattern minimization problem.
Computers & Operations Research,
Vol. 36,
Issue. 11,
p.
2944.
Clautiaux, François
Alves, Cláudio
and
Valério de Carvalho, José
2010.
A survey of dual-feasible and superadditive functions.
Annals of Operations Research,
Vol. 179,
Issue. 1,
p.
317.
Ekici, Ali
Ergun, Özlem
Keskinocak, Pınar
and
Lagoudakis, Michail G.
2010.
Optimal job splitting on a multi‐slot machine with applications in the printing industry.
Naval Research Logistics (NRL),
Vol. 57,
Issue. 3,
p.
237.
Aloisio, Alessandro
Arbib, Claudio
and
Marinelli, Fabrizio
2011.
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization.
Discrete Optimization,
Vol. 8,
Issue. 2,
p.
315.
Henn, Sebastian
and
Wäscher, Gerhard
2013.
Extensions of cutting problems: setups.
Pesquisa Operacional,
Vol. 33,
Issue. 2,
p.
133.
Mobasher, Azadeh
and
Ekici, Ali
2013.
Solution approaches for the cutting stock problem with setup cost.
Computers & Operations Research,
Vol. 40,
Issue. 1,
p.
225.
Araujo, Silvio Alexandre de
Poldi, Kelly Cristina
and
Smith, Jim
2014.
A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS.
Pesquisa Operacional,
Vol. 34,
Issue. 2,
p.
165.
Aliano Filho, Angelo
Moretti, António Carlos
and
Pato, Margarida Vaz
2018.
A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem.
Journal of the Operational Research Society,
Vol. 69,
Issue. 1,
p.
91.
Ma, Ning
Liu, Ya
and
Zhou, Zhili
2019.
Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost.
Computers & Operations Research,
Vol. 109,
Issue. ,
p.
218.
Alfares, Hesham K.
and
Alsawafy, Omar G.
2019.
A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem.
International Journal of Applied Industrial Engineering,
Vol. 6,
Issue. 2,
p.
1.
Martin, Mateus
Yanasse, Horacio Hideki
and
Salles-Neto, Luiz Leduíno
2022.
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost.
Journal of Combinatorial Optimization,
Vol. 44,
Issue. 1,
p.
557.
da Silva, Heloisa Vasques
Lemos, Felipe Kesrouani
Cherri, Adriana Cristina
and
de Araujo, Silvio Alexandre
2023.
Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes.
RAIRO - Operations Research,
Vol. 57,
Issue. 1,
p.
183.
Xiao, Haihua
Liang, Qiaokang
Zhang, Dan
Xiao, Suhua
and
Nie, Gangzhuo
2023.
A method for demand-accurate one-dimensional cutting problems with pattern reduction.
Mathematical Biosciences and Engineering,
Vol. 20,
Issue. 4,
p.
7453.
Kraul, Sebastian
Seizinger, Markus
and
Brunner, Jens O.
2023.
Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation.
INFORMS Journal on Computing,
Vol. 35,
Issue. 3,
p.
692.
Silva, Eduardo M.
Melega, Gislaine M.
Akartunalı, Kerem
and
de Araujo, Silvio A.
2023.
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost.
European Journal of Operational Research,
Vol. 304,
Issue. 2,
p.
443.
Barragan-Vite, Irving
Medina-Marin, Joselito
Hernandez-Romero, Norberto
and
Anaya-Fuentes, Gustavo Erick
2024.
A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem.
Applied Sciences,
Vol. 14,
Issue. 18,
p.
8172.