Author of the publication

A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands.

, , , , and . ECSQARU, volume 10369 of Lecture Notes in Computer Science, page 190-200. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Projective Cutting-Planes.. SIAM J. Optimization, 30 (1): 1007-1032 (2020)Prize-collecting set multicovering with submodular pricing.. ITOR, 25 (4): 1221-1239 (2018)The capacitated vehicle routing problem with evidential demands., , , , and . Int. J. Approx. Reason., (2018)From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints.. Discret. Optim., (2018)Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems.. INFORMS J. Comput., 34 (5): 2736-2753 (2022)Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem., , , and . Eur. J. Oper. Res., 256 (2): 349-367 (2017)A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands., , , , and . ECSQARU, volume 10369 of Lecture Notes in Computer Science, page 190-200. Springer, (2017)Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems., , and . Eur. J. Oper. Res., 313 (1): 25-43 (February 2024)The Capacitated Vehicle Routing Problem with Evidential Demands: A Belief-Constrained Programming Approach., , , , and . BELIEF, volume 9861 of Lecture Notes in Computer Science, page 212-221. Springer, (2016)Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation.. Math. Program., 155 (1-2): 147-197 (2016)