Gleb Belov

According to our database1, Gleb Belov authored at least 19 papers between 2001 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Human-Centred Feasibility Restoration.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
Logistics optimization for a coal supply chain.
J. Heuristics, 2020

From Multi-Agent Pathfinding to 3D Pipe Routing.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

2019
Position Paper: From Multi-Agent Pathfinding to Pipe Routing.
CoRR, 2019

2018
Process Plant Layout Optimization: Equipment Allocation.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
Estimating the size of search trees by sampling with domain knowledge.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

An Optimization Model for 3D Pipe Routing with Flexibility Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
Improved Linearization of Constraint Programming Models.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2014
Local Search for a Cargo Assembly Planning Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013
Conservative scales in packing problems.
OR Spectr., 2013

LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility.
Oper. Res., 2013

2012
LP bounds in various constraint programming approaches for orthogonal packing.
Comput. Oper. Res., 2012

2009
One-dimensional relaxations and LP bounds for orthogonal packing.
Int. Trans. Oper. Res., 2009

2008
One-dimensional heuristics adapted for two-dimensional rectangular strip packing.
J. Oper. Res. Soc., 2008

2007
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting.
INFORMS J. Comput., 2007

2006
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting.
Eur. J. Oper. Res., 2006

A Basic Data Routing Model for a Coarse-Grain Reconfigurable Hardware.
Proceedings of the Reconfigurable Computing: Architectures and Applications, 2006

2002
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths.
Eur. J. Oper. Res., 2002

2001
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm.
J. Oper. Res. Soc., 2001


  Loading...