Guillotine cutting (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Guillotine cutting" in English language version.

refsWebsite

Global rank English rank

18doi.org

2^nd place

14worldcat.org

5^th place

6semanticscholar.org

11^th place

8^th place

5informs.org

low place

9,066^th place

3sciencedirect.com

149^th place

178^th place

2ieee.org

652^nd place

515^th place

1roadef.org

low place

1uwa.edu.au

7,226^th place

4,917^th place

1web.archive.org

1^st place

1wiley.com

222^nd place

297^th place

1tu-dresden.de

low place

1amzi.com

low place

1elibrary.ru

1,940^th place

low place

1uni-konstanz.de

low place

8,610^th place

1dagstuhl.de

low place

amzi.com

Michael L. McHale, Roshan P. Shah Cutting the Guillotine Down to Size. PC AI magazine, Volume 13, Number 1 Jan/Feb 99. http://www.amzi.com/articles/papercutter.htm

dagstuhl.de

drops.dagstuhl.de

Khan, Arindam; Pittu, Madhusudhan Reddy (2020). Byrka, Jaros\law; Meka, Raghu (eds.). "On Guillotine Separability of Squares and Rectangles". Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs). 176. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum für Informatik: 47:1–47:22. doi:10.4230/LIPIcs.APPROX/RANDOM.2020.47. ISBN 978-3-95977-164-1.

doi.org

Beasley, J. E. (1985-04-01). "Algorithms for Unconstrained Two-Dimensional Guillotine Cutting". Journal of the Operational Research Society. 36 (4): 297–306. doi:10.1057/jors.1985.51. ISSN 0160-5682. S2CID 58059319.
Clautiaux, François; Jouglet, Antoine; Moukrim, Aziz (2011-10-17). "A New Graph-Theoretical Model for the Guillotine-Cutting Problem". INFORMS Journal on Computing. 25 (1): 72–86. doi:10.1287/ijoc.1110.0478. ISSN 1091-9856.
Ben Messaoud, Said; Chu, Chengbin; Espinouse, Marie-Laure (2008-11-16). "Characterization and modelling of guillotine constraints". European Journal of Operational Research. 191 (1): 112–126. doi:10.1016/j.ejor.2007.08.029. ISSN 0377-2217.
M. Hifi, R. M’Hallah and T. Saadi, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem. Computational Optimization and Applications, Volume 42, Number 2 (2009), 303-326, doi:10.1007/s10589-007-9081-5
Carlier, Jacques; Clautiaux, François; Moukrim, Aziz (2007-08-01). "New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation". Computers & Operations Research. 34 (8): 2223–2250. doi:10.1016/j.cor.2005.08.012. ISSN 0305-0548.
Russo, Mauro; Boccia, Maurizio; Sforza, Antonio; Sterle, Claudio (2020). "Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization". International Transactions in Operational Research. 27 (2): 794–834. doi:10.1111/itor.12687. ISSN 1475-3995. S2CID 195551953.
Tarnowski, A. G.; Terno, J.; Scheithauer, G. (1994-11-01). "A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem". INFOR: Information Systems and Operational Research. 32 (4): 275–287. doi:10.1080/03155986.1994.11732257. ISSN 0315-5986.
Gilmore, P. C.; Gomory, R. E. (1965-02-01). "Multistage Cutting Stock Problems of Two and More Dimensions". Operations Research. 13 (1): 94–120. doi:10.1287/opre.13.1.94. ISSN 0030-364X.
Gilmore, P. C.; Gomory, R. E. (1966-12-01). "The Theory and Computation of Knapsack Functions". Operations Research. 14 (6): 1045–1074. doi:10.1287/opre.14.6.1045. ISSN 0030-364X.
Herz, J. C. (September 1972). "Recursive Computational Procedure for Two-dimensional Stock Cutting". IBM Journal of Research and Development. 16 (5): 462–469. doi:10.1147/rd.165.0462. ISSN 0018-8646.
Christofides, Nicos; Whitlock, Charles (1977-02-01). "An Algorithm for Two-Dimensional Cutting Problems". Operations Research. 25 (1): 30–44. doi:10.1287/opre.25.1.30. ISSN 0030-364X.
Wang, P. Y. (1983-06-01). "Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems". Operations Research. 31 (3): 573–586. doi:10.1287/opre.31.3.573. ISSN 0030-364X.
Pach, J.; Tardos, G. (2000). "Cutting Glass". Discrete and Computational Geometry. 24 (2–3): 481–496. doi:10.1007/s004540010050. ISSN 0179-5376. S2CID 1737527.
Abed, Fidaa; Chalermsook, Parinya; Correa, José; Karrenbauer, Andreas; Pérez-Lantero, Pablo; Soto, José A.; Wiese, Andreas (2015). On Guillotine Cutting Sequences. pp. 1–19. doi:10.4230/LIPIcs.APPROX-RANDOM.2015.1. ISBN 978-3-939897-89-7.
Khan, Arindam; Pittu, Madhusudhan Reddy (2020). Byrka, Jaros\law; Meka, Raghu (eds.). "On Guillotine Separability of Squares and Rectangles". Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs). 176. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum für Informatik: 47:1–47:22. doi:10.4230/LIPIcs.APPROX/RANDOM.2020.47. ISBN 978-3-95977-164-1.
Martin, Mateus; Oliveira, José Fernando; Silva, Elsa; Morabito, Reinaldo; Munari, Pedro (2020-11-08). "Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm". Expert Systems with Applications. 168: 114257. doi:10.1016/j.eswa.2020.114257. ISSN 0957-4174. S2CID 228839108.
Baazaoui, M.; Hanafi, S.; Kamoun, H. (2014-11-01). "A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case". 2014 International Conference on Control, Decision and Information Technologies (CoDIT). pp. 219–224. doi:10.1109/CoDIT.2014.6996896. ISBN 978-1-4799-6773-5. S2CID 18598442.
Martin, Mateus; Hokama, Pedro H. D. B.; Morabito, Reinaldo; Munari, Pedro (2020-05-02). "The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm". International Journal of Production Research. 58 (9): 2712–2729. doi:10.1080/00207543.2019.1630773. ISSN 0020-7543. S2CID 197434029.

elibrary.ru

Pach, J.; Tardos, G. (2000). "Cutting Glass". Discrete and Computational Geometry. 24 (2–3): 481–496. doi:10.1007/s004540010050. ISSN 0179-5376. S2CID 1737527.

ieee.org

ieeexplore.ieee.org

Herz, J. C. (September 1972). "Recursive Computational Procedure for Two-dimensional Stock Cutting". IBM Journal of Research and Development. 16 (5): 462–469. doi:10.1147/rd.165.0462. ISSN 0018-8646.
Baazaoui, M.; Hanafi, S.; Kamoun, H. (2014-11-01). "A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case". 2014 International Conference on Control, Decision and Information Technologies (CoDIT). pp. 219–224. doi:10.1109/CoDIT.2014.6996896. ISBN 978-1-4799-6773-5. S2CID 18598442.

informs.org

pubsonline.informs.org

Clautiaux, François; Jouglet, Antoine; Moukrim, Aziz (2011-10-17). "A New Graph-Theoretical Model for the Guillotine-Cutting Problem". INFORMS Journal on Computing. 25 (1): 72–86. doi:10.1287/ijoc.1110.0478. ISSN 1091-9856.
Gilmore, P. C.; Gomory, R. E. (1965-02-01). "Multistage Cutting Stock Problems of Two and More Dimensions". Operations Research. 13 (1): 94–120. doi:10.1287/opre.13.1.94. ISSN 0030-364X.
Gilmore, P. C.; Gomory, R. E. (1966-12-01). "The Theory and Computation of Knapsack Functions". Operations Research. 14 (6): 1045–1074. doi:10.1287/opre.14.6.1045. ISSN 0030-364X.
Christofides, Nicos; Whitlock, Charles (1977-02-01). "An Algorithm for Two-Dimensional Cutting Problems". Operations Research. 25 (1): 30–44. doi:10.1287/opre.25.1.30. ISSN 0030-364X.
Wang, P. Y. (1983-06-01). "Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems". Operations Research. 31 (3): 573–586. doi:10.1287/opre.31.3.573. ISSN 0030-364X.

roadef.org

Tlilane, Lydia; Viaud, Quentin (2018-05-18). "Challenge ROADEF / EURO 2018 Cutting Optimization Problem Description" (PDF). Challenge ROADEF/EURO. ROADEF. Retrieved 2019-06-13.

sciencedirect.com

Ben Messaoud, Said; Chu, Chengbin; Espinouse, Marie-Laure (2008-11-16). "Characterization and modelling of guillotine constraints". European Journal of Operational Research. 191 (1): 112–126. doi:10.1016/j.ejor.2007.08.029. ISSN 0377-2217.
Carlier, Jacques; Clautiaux, François; Moukrim, Aziz (2007-08-01). "New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation". Computers & Operations Research. 34 (8): 2223–2250. doi:10.1016/j.cor.2005.08.012. ISSN 0305-0548.
Martin, Mateus; Oliveira, José Fernando; Silva, Elsa; Morabito, Reinaldo; Munari, Pedro (2020-11-08). "Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm". Expert Systems with Applications. 168: 114257. doi:10.1016/j.eswa.2020.114257. ISSN 0957-4174. S2CID 228839108.

semanticscholar.org

api.semanticscholar.org

Beasley, J. E. (1985-04-01). "Algorithms for Unconstrained Two-Dimensional Guillotine Cutting". Journal of the Operational Research Society. 36 (4): 297–306. doi:10.1057/jors.1985.51. ISSN 0160-5682. S2CID 58059319.
Russo, Mauro; Boccia, Maurizio; Sforza, Antonio; Sterle, Claudio (2020). "Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization". International Transactions in Operational Research. 27 (2): 794–834. doi:10.1111/itor.12687. ISSN 1475-3995. S2CID 195551953.
Pach, J.; Tardos, G. (2000). "Cutting Glass". Discrete and Computational Geometry. 24 (2–3): 481–496. doi:10.1007/s004540010050. ISSN 0179-5376. S2CID 1737527.
Martin, Mateus; Oliveira, José Fernando; Silva, Elsa; Morabito, Reinaldo; Munari, Pedro (2020-11-08). "Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm". Expert Systems with Applications. 168: 114257. doi:10.1016/j.eswa.2020.114257. ISSN 0957-4174. S2CID 228839108.
Baazaoui, M.; Hanafi, S.; Kamoun, H. (2014-11-01). "A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case". 2014 International Conference on Control, Decision and Information Technologies (CoDIT). pp. 219–224. doi:10.1109/CoDIT.2014.6996896. ISBN 978-1-4799-6773-5. S2CID 18598442.
Martin, Mateus; Hokama, Pedro H. D. B.; Morabito, Reinaldo; Munari, Pedro (2020-05-02). "The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm". International Journal of Production Research. 58 (9): 2712–2729. doi:10.1080/00207543.2019.1630773. ISSN 0020-7543. S2CID 197434029.

tu-dresden.de

math.tu-dresden.de

Scheithauer, Guntram (1993). "Computation of optimal φ-simple guillotine cutting patterns" (PDF). Journal of Information Processing and Cybernetics. 29 (2): 115–128.

uni-konstanz.de

kops.uni-konstanz.de

Abed, Fidaa; Chalermsook, Parinya; Correa, José; Karrenbauer, Andreas; Pérez-Lantero, Pablo; Soto, José A.; Wiese, Andreas (2015). On Guillotine Cutting Sequences. pp. 1–19. doi:10.4230/LIPIcs.APPROX-RANDOM.2015.1. ISBN 978-3-939897-89-7.

uwa.edu.au

teaching.csse.uwa.edu.au

Gerhard Wäscher, Heike Haußner, Holger Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research 183 (2007) 1109–1130, [1] Archived 2016-12-20 at the Wayback Machine

web.archive.org

Gerhard Wäscher, Heike Haußner, Holger Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research 183 (2007) 1109–1130, [1] Archived 2016-12-20 at the Wayback Machine

wiley.com

onlinelibrary.wiley.com

Russo, Mauro; Boccia, Maurizio; Sforza, Antonio; Sterle, Claudio (2020). "Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization". International Transactions in Operational Research. 27 (2): 794–834. doi:10.1111/itor.12687. ISSN 1475-3995. S2CID 195551953.

worldcat.org

search.worldcat.org

Beasley, J. E. (1985-04-01). "Algorithms for Unconstrained Two-Dimensional Guillotine Cutting". Journal of the Operational Research Society. 36 (4): 297–306. doi:10.1057/jors.1985.51. ISSN 0160-5682. S2CID 58059319.
Clautiaux, François; Jouglet, Antoine; Moukrim, Aziz (2011-10-17). "A New Graph-Theoretical Model for the Guillotine-Cutting Problem". INFORMS Journal on Computing. 25 (1): 72–86. doi:10.1287/ijoc.1110.0478. ISSN 1091-9856.
Ben Messaoud, Said; Chu, Chengbin; Espinouse, Marie-Laure (2008-11-16). "Characterization and modelling of guillotine constraints". European Journal of Operational Research. 191 (1): 112–126. doi:10.1016/j.ejor.2007.08.029. ISSN 0377-2217.
Carlier, Jacques; Clautiaux, François; Moukrim, Aziz (2007-08-01). "New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation". Computers & Operations Research. 34 (8): 2223–2250. doi:10.1016/j.cor.2005.08.012. ISSN 0305-0548.
Russo, Mauro; Boccia, Maurizio; Sforza, Antonio; Sterle, Claudio (2020). "Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization". International Transactions in Operational Research. 27 (2): 794–834. doi:10.1111/itor.12687. ISSN 1475-3995. S2CID 195551953.
Tarnowski, A. G.; Terno, J.; Scheithauer, G. (1994-11-01). "A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem". INFOR: Information Systems and Operational Research. 32 (4): 275–287. doi:10.1080/03155986.1994.11732257. ISSN 0315-5986.
Gilmore, P. C.; Gomory, R. E. (1965-02-01). "Multistage Cutting Stock Problems of Two and More Dimensions". Operations Research. 13 (1): 94–120. doi:10.1287/opre.13.1.94. ISSN 0030-364X.
Gilmore, P. C.; Gomory, R. E. (1966-12-01). "The Theory and Computation of Knapsack Functions". Operations Research. 14 (6): 1045–1074. doi:10.1287/opre.14.6.1045. ISSN 0030-364X.
Herz, J. C. (September 1972). "Recursive Computational Procedure for Two-dimensional Stock Cutting". IBM Journal of Research and Development. 16 (5): 462–469. doi:10.1147/rd.165.0462. ISSN 0018-8646.
Christofides, Nicos; Whitlock, Charles (1977-02-01). "An Algorithm for Two-Dimensional Cutting Problems". Operations Research. 25 (1): 30–44. doi:10.1287/opre.25.1.30. ISSN 0030-364X.
Wang, P. Y. (1983-06-01). "Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems". Operations Research. 31 (3): 573–586. doi:10.1287/opre.31.3.573. ISSN 0030-364X.
Pach, J.; Tardos, G. (2000). "Cutting Glass". Discrete and Computational Geometry. 24 (2–3): 481–496. doi:10.1007/s004540010050. ISSN 0179-5376. S2CID 1737527.
Martin, Mateus; Oliveira, José Fernando; Silva, Elsa; Morabito, Reinaldo; Munari, Pedro (2020-11-08). "Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm". Expert Systems with Applications. 168: 114257. doi:10.1016/j.eswa.2020.114257. ISSN 0957-4174. S2CID 228839108.
Martin, Mateus; Hokama, Pedro H. D. B.; Morabito, Reinaldo; Munari, Pedro (2020-05-02). "The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm". International Journal of Production Research. 58 (9): 2712–2729. doi:10.1080/00207543.2019.1630773. ISSN 0020-7543. S2CID 197434029.