Gleb Belov
Gleb Belov
Research Fellow, Faculty of Information Technology, Monash University
Verified email at monash.edu
TitleCited byYear
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
1682002
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
1562006
Setup and open-stacks minimization in one-dimensional stock cutting
G Belov, G Scheithauer
INFORMS Journal on Computing 19 (1), 27-35, 2007
892007
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
672008
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
522001
Problems, models and algorithms in one-and two-dimensional cutting
G Belov
442004
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
392009
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
352000
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
352000
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
262003
LP bounds in various constraint programming approaches for orthogonal packing
M Mesyagutov, G Scheithauer, G Belov
Computers & Operations Research 39 (10), 2425-2438, 2012
192012
Conservative scales in packing problems
G Belov, VM Kartak, H Rohling, G Scheithauer
OR spectrum 35 (2), 505-542, 2013
182013
Improved linearization of constraint programming models
G Belov, PJ Stuckey, G Tack, M Wallace
International Conference on Principles and Practice of Constraint …, 2016
152016
LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
G Belov, H Rohling
Operations Research 61 (2), 483-497, 2013
112013
A node-flow model for the 1D stock cutting: robust branch-cut-and-price
G Belov, AN Letchford, E Uchoa
University of Dresden, Lancaster University and Universidade Federal Fluminense, 2005
92005
Onedimensional cutting stock problem: Numerical experiments with the sequential value correction method and a modified branch-and-bound method
EA Mukhacheva, G Belov, V Kartak, AS Mukhacheva
Pesquisa Operacional 20 (2), 153-168, 2001
82001
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
72014
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
62005
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
52017
New constraint programming approaches for 3D orthogonal packing
M Mesyagutov, G Scheithauer, G Belov
Technische Universität Dresden, Dresden, Germany, 2012
52012
The system can't perform the operation now. Try again later.
Articles 1–20