| A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting G Belov, G Scheithauer European journal of operational research 171 (1), 85-106, 2006 | 184 | 2006 |
| A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths G Belov, G Scheithauer European Journal of Operational Research 141 (2), 274-294, 2002 | 175 | 2002 |
| Setup and open-stacks minimization in one-dimensional stock cutting G Belov, G Scheithauer INFORMS Journal on Computing 19 (1), 27-35, 2007 | 95 | 2007 |
| One-dimensional heuristics adapted for two-dimensional rectangular strip packing G Belov, G Scheithauer, EA Mukhacheva Journal of the Operational Research Society 59 (6), 823-832, 2008 | 72 | 2008 |
| Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm G Scheithauer, J Terno, A Müller, G Belov Journal of the Operational Research Society 52 (12), 1390-1401, 2001 | 55 | 2001 |
| Problems, models and algorithms in one-and two-dimensional cutting G Belov | 49 | 2003 |
| One‐dimensional relaxations and LP bounds for orthogonal packing G Belov, V Kartak, H Rohling, G Scheithauer International Transactions in Operational Research 16 (6), 745-766, 2009 | 41 | 2009 |
| Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) EA Mukhacheva, GN Belov, VM Kartack, AS Mukhacheva Pesquisa Operacional 20 (2), 153-168, 2000 | 35 | 2000 |
| The number of setups (different patterns) in one-dimensional stock cutting G Belov, G Scheithauer Preprint MATH-NM-15-2003, Department of Mathematics, Dresden University of …, 2003 | 28 | 2003 |
| Improved linearization of constraint programming models G Belov, PJ Stuckey, G Tack, M Wallace International Conference on Principles and Practice of Constraint …, 2016 | 27 | 2016 |
| LP bounds in various constraint programming approaches for orthogonal packing M Mesyagutov, G Scheithauer, G Belov Computers & operations research 39 (10), 2425-2438, 2012 | 23 | 2012 |
| Conservative scales in packing problems G Belov, VM Kartak, H Rohling, G Scheithauer OR spectrum 35 (2), 505-542, 2013 | 21 | 2013 |
| LP bounds in an interval-graph algorithm for orthogonal-packing feasibility G Belov, H Rohling Operations Research 61 (2), 483-497, 2013 | 13 | 2013 |
| A node-flow model for 1D stock cutting: Robust branch-cut-and-price G Belov, AN Letchford, E Uchoa University of Dresden, Lancaster University and Universidade Federal Fluminense, 2005 | 12 | 2005 |
| Local search for a cargo assembly planning problem G Belov, N Boland, MWP Savelsbergh, PJ Stuckey International Conference on AI and OR Techniques in Constriant Programming …, 2014 | 8 | 2014 |
| An optimization model for 3D pipe routing with flexibility constraints G Belov, T Czauderna, A Dzaferovic, MG de la Banda, M Wybrow, ... International Conference on Principles and Practice of Constraint …, 2017 | 6 | 2017 |
| Estimating the size of search trees by sampling with domain knowledge. G Belov, S Esler, D Fernando, P Le Bodic, GL Nemhauser IJCAI, 473-479, 2017 | 6 | 2017 |
| Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution MA Mesyagutov, EA Mukhacheva, GN Belov, G Scheithauer Automation and Remote Control 72 (1), 141-159, 2011 | 6 | 2011 |
| The two-dimensional strip packing problem: A numerical experiment with waste-free instances using algorithms with block structure G Belov, AV Chiglintsev, AS Filippova, E Mukhacheva, G Scheithauer, ... Preprint MATH-NM-01-2005 TU Dresden, 2005 | 6 | 2005 |
| New constraint programming approaches for 3d orthogonal packing M Mesyagutov, G Scheithauer, G Belov Technische Universität Dresden, Dresden, Germany, 2012 | 5 | 2012 |
Peter StuckeyFaculty of Information Technology, Monash UniversityEmail confirmado em monash.edu
