Author of the publication

Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition.

, , and . Ann. Oper. Res., 322 (1): 467-496 (March 2023)

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

Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint., , and . WAOA, volume 12982 of Lecture Notes in Computer Science, page 206-223. Springer, (2021)Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride., , , and . WADS, volume 14079 of Lecture Notes in Computer Science, page 43-64. Springer, (2023)Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents., , , , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 139-153. Springer, (2019)Scheduling maintenance jobs in networks., , , , , , , and . Theor. Comput. Sci., (2019)Breaking the Size Barrier: Universal Circuits Meet Lookup Tables., , , , , and . ASIACRYPT (1), volume 14438 of Lecture Notes in Computer Science, page 3-37. Springer, (2023)Efficient fully dynamic elimination forests with applications to detecting long paths and cycles., , , , , , , , , and 1 other author(s). SODA, page 796-809. SIAM, (2021)A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules., and . ISAAC, volume 283 of LIPIcs, page 27:1-27:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Minimum Feasible Tileset Problem., , and . Algorithmica, 81 (3): 1126-1151 (2019)Degree-Constrained Orientations of Embedded Graphs., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 506-516. Springer, (2012)Improved Bounds for Open Online Dial-a-Ride on the Line., , and . APPROX-RANDOM, volume 145 of LIPIcs, page 21:1-21:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)