Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

S. Emde, S. Zehtabian, and Y. Disser. 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.

Yann Disser

Bernd Disser

Stephan Disser

Georgios Yannis

Christos Yannissis

Other publications of authors with the same name

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.J. Chen, W. Czerwinski, Y. Disser, A. Feldmann, D. Hermelin, W. Nadara, M. Pilipczuk, M. Pilipczuk, M. Sorge, B. Wróblewski and 1 other author(s). SODA, page 796-809. SIAM, (2021)Breaking the Size Barrier: Universal Circuits Meet Lookup Tables.Y. Disser, D. Günther, T. Schneider, M. Stillger, A. Wigandt, and H. Yalame. ASIACRYPT (1), volume 14438 of Lecture Notes in Computer Science, page 3-37. Springer, (2023)Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.J. Baligács, Y. Disser, F. Soheil, and D. Weckbecker. WADS, volume 14079 of Lecture Notes in Computer Science, page 43-64. Springer, (2023)Scheduling maintenance jobs in networks.F. Abed, L. Chen, Y. Disser, M. Groß, N. Megow, J. Meißner, A. Richter, and R. Rischke. Theor. Comput. Sci., (2019)Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents.J. Chalopin, S. Das, Y. Disser, A. Labourel, and M. Mihalák. SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 139-153. Springer, (2019)Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.Y. Disser, M. Klimm, and D. Weckbecker. WAOA, volume 12982 of Lecture Notes in Computer Science, page 206-223. Springer, (2021)A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules.Y. Disser, and N. Mosis. ISAAC, volume 283 of LIPIcs, page 27:1-27:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Unified greedy approximability beyond submodular maximization.Y. Disser, and D. Weckbecker. CoRR, (2020)Improved Universal Circuits using Lookup Tables.Y. Disser, D. Günther, T. Schneider, M. Stillger, A. Wigandt, and H. Yalame. IACR Cryptol. ePrint Arch., (2022)On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.Y. Disser, and A. Hopp. IPCO, volume 11480 of Lecture Notes in Computer Science, page 168-180. Springer, (2019)

BibSonomy

Disambiguation of "Disser, Yann"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

Please choose a person to relate this publication to

Yann Disser

Bernd Disser

Stephan Disser

Georgios Yannis

Christos Yannissis

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Disser, Yann"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition.

Please choose a person to relate this publication to

Yann Disser

Bernd Disser

Stephan Disser

Georgios Yannis

Christos Yannissis

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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