Results 241 to 250 of about 143,487 (265)

Parallel branch and cut for capacitated vehicle routing

Parallel Computing, 2003
Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to parallelize, achieving scalability can be a challenge.
openaire   +1 more source

Branch-and-Cut for the LOP

2022
Rafael Martí, Gerhard Reinelt
openaire   +1 more source

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems

INFORMS Journal on Computing, 2020
Zhixing Luo, Lijun Wei, Andrew Lim
exaly  

Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows

International Journal of Production Research, 2022
Bulent Çatay, Duygu Tas
exaly  

Integer Programming: Branch and Cut Algorithms, Branch and Cut

2012
openaire   +1 more source

Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

Management Science, 1996
Gérard Cornuejols, Egon Balas, Sebastian Ceria   +2 more
exaly  

A novel algorithm for branch cut phase unwrapping

Optics and Lasers in Engineering, 2011
Feipeng Da, Dongliang Zheng
exaly  

Exact Branch-Price-and-Cut Algorithms for Vehicle Routing

Transportation Science, 2019
Claudio Contardo, Luciano Costa, Guy Desaulniers   +2 more
exaly  

Branch-and-cut algorithms for the split delivery vehicle routing problem

European Journal of Operational Research, 2014
Claudia Archetti, Nicola Bianchessi, M Grazia Speranza   +2 more
exaly  

Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows

Transportation Science, 2018
Stefan Irnich, Ann-Kathrin Rothenbacher   +1 more
exaly