Vera C. Hemmelmayr

According to our database, Vera C. Hemmelmayr authored at least 17 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Transition towards sustainable mobility: the role of transport optimization.

Belma Turan, Vera C. Hemmelmayr, Allan Larsen, Jakob Puchinger

Central Eur. J. Oper. Res., June, 2024

2023

A lexicographic maximin approach to the selective assessment routing problem.

Mohammadmehdi Hakimifar, Vera C. Hemmelmayr, Fabien Tricoire

OR Spectr., March, 2023

2022

Evaluation of field visit planning heuristics during rapid needs assessment in an uncertain post-disaster environment.

Mohammadmehdi Hakimifar, Burcu Balcik, Christian Fikar, Vera C. Hemmelmayr, Tina Wakolbinger

Ann. Oper. Res., 2022

2021

Integrated express shipment service network design with customer choice and endogenous delivery time restrictions.

Florian Martin, Vera C. Hemmelmayr, Tina Wakolbinger

Eur. J. Oper. Res., 2021

Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and 'grey zone' customers arising in urban logistics.

Alexandra Anderluh, Pamela C. Nolz, Vera C. Hemmelmayr, Teodor Gabriel Crainic

Eur. J. Oper. Res., 2021

2017

Synchronizing vans and cargo bikes in a city distribution network.

Alexandra Anderluh, Vera C. Hemmelmayr, Pamela C. Nolz

Central Eur. J. Oper. Res., 2017

2015

Sequential and parallel large neighborhood search algorithms for the periodic location routing problem.

Vera C. Hemmelmayr

Eur. J. Oper. Res., 2015

2014

Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management.

Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Daniele Vigo

Transp. Sci., 2014

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

Valentina Cacchiani, Vera C. Hemmelmayr, Fabien Tricoire

Discret. Appl. Math., 2014

2013

A heuristic solution method for node routing based solid waste collection problems.

Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Stefan Rath

J. Heuristics, 2013

2012

Variable neighbourhood search for the variable sized bin packing problem.

Vera C. Hemmelmayr, Verena Schmid, Christian Blum

Comput. Oper. Res., 2012

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.

Vera C. Hemmelmayr, Jean-François Cordeau, Teodor Gabriel Crainic

Comput. Oper. Res., 2012

Lower and upper bounds for the two-echelon capacitated location-routing problem.

Claudio Contardo, Vera C. Hemmelmayr, Teodor Gabriel Crainic

Comput. Oper. Res., 2012

2010

Vendor managed inventory for environments with stochastic product usage.

Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh

Eur. J. Oper. Res., 2010

Hybrid Algorithms for the Variable Sized Bin Packing Problem.

Christian Blum, Vera C. Hemmelmayr, Hugo Hernández, Verena Schmid

Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009

Delivery strategies for blood products supplies.

Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh

OR Spectr., 2009

A variable neighborhood search heuristic for periodic routing problems.

Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl

Eur. J. Oper. Res., 2009