Results 271 to 280 of about 9,957 (290)
Some of the next articles are maybe not open access.
A branch‐and‐price algorithm for the rainbow cycle cover problems
Networks, 2018AbstractA rainbow cycle in an undirected edge‐colored graph is a cycle in which all edges have different colors. A rainbow cycle cover of a graph is a set of disjoint rainbow cycles, where each vertex belongs to exactly one cycle. The objective of the rainbow cycle cover problem is to minimize the number of rainbow cycles used to cover the vertices of ...
Birol Yüceoglu, Güvenç Sahin
openaire +3 more sources
Exact Branch-Price-and-Cut Algorithms for Vehicle Routing
Transportation Science, 2019Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes of VRPs are branch-price-and-cut algorithms. In this survey paper, we highlight the main methodological and modeling contributions made over the years on branch-and-price (branch-price-and-cut ...
Luciano Costa +2 more
openaire +1 more source
A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates
Transportation Research, Part E: Logistics and Transportation Review, 2021Jasmine Siu Lee Lam +2 more
exaly
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
INFORMS Journal on Computing, 2020Zhixing LUO, Lijun Wei, Andrew Lim
exaly
A branch-and-price algorithm for the two-dimensional vector packing problem
European Journal of Operational Research, 2020Qian Hu, Lijun Wei, Minghui Lai
exaly
Branch-and-price algorithm for the location-routing problem with time windows
Transportation Research, Part E: Logistics and Transportation Review, 2016Ali Gul Qureshi, Eiichi Taniguchi
exaly
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
Transportation Science, 2015Alexandre Salles Da Cunha +1 more
exaly