From post

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.

 

Другие публикации лиц с тем же именем

A computational evaluation of a general branch-and-price framework for capacitated network location problems., , и . Ann. Oper. Res., 167 (1): 209-251 (2009)A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows., , и . Math. Program. Comput., 6 (2): 171-197 (2014)A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies., , , , и . Oper. Res. Forum, (2021)Mathematical Programming bounds for Large-Scale Unit Commitment Problems in Medium-Term Energy System Simulations., , , и . SCOR, том 37 из OASIcs, стр. 63-75. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses., , и . J. Sched., 27 (4): 393-407 (августа 2024)Mathematical programming algorithms for spatial cloaking., , , и . CTW, стр. 217-220. (2015)An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem., и . Oper. Res., 56 (2): 425-436 (2008)Optimally rescheduling jobs with a LIFO buffer., , , , и . CoRR, (2021)Dynamic programming algorithms for the elementary shortest path problem with resource constraints., и . Electron. Notes Discret. Math., (2004)A branch-and-bound algorithm for the linear ordering problem with cumulative costs.. Eur. J. Oper. Res., 186 (3): 965-971 (2008)