Author of the publication

Planning Freight Delivery Routes in Mountainous Regions.

, , , , and . MS, volume 254 of Lecture Notes in Business Information Processing, page 123-132. Springer, (2016)

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

Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective., , and . EURO J. Comput. Optim., 6 (2): 117-142 (2018)Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective., , and . ATMOS, volume 33 of OASIcs, page 137-149. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Ground stations networks for Free-Space Optical communications: maximizing the data transfer., , , and . Electron. Notes Discret. Math., (2018)Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems., , , and . Eur. J. Oper. Res., 283 (3): 812-824 (2020)Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing., , and . Artificial Evolution, volume 3871 of Lecture Notes in Computer Science, page 131-142. Springer, (2005)A mass-flow MILP formulation for energy-efficient supplying in assembly lines., , , , , and . CoRR, (2015)The bi-objective covering tour problem., , and . Comput. Oper. Res., 34 (7): 1929-1942 (2007)Target aiming Pareto search and its application to the vehicle routing problem with route balancing., , and . J. Heuristics, 13 (5): 455-469 (2007)Inventory Routing with Explicit Energy Consumption: A Mass-Flow Formulation and First Experimentation., , and . ICORES (Selected Papers), volume 695 of Communications in Computer and Information Science, page 96-116. (2016)Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits., , and . J. Math. Model. Algorithms, 7 (2): 177-195 (2008)