default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVera C. Hemmelmayr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Belma Turan
, Vera C. Hemmelmayr, Allan Larsen, Jakob Puchinger:
Transition towards sustainable mobility: the role of transport optimization. Central Eur. J. Oper. Res. 32(2): 435-456 (2024)- 2023
- [j15]Mohammadmehdi Hakimifar, Vera C. Hemmelmayr, Fabien Tricoire:
A lexicographic maximin approach to the selective assessment routing problem. OR Spectr. 45(1): 205-249 (2023) - 2022
- [j14]Mohammadmehdi Hakimifar, Burcu Balcik, Christian Fikar, Vera C. Hemmelmayr, Tina Wakolbinger:
Evaluation of field visit planning heuristics during rapid needs assessment in an uncertain post-disaster environment. Ann. Oper. Res. 319(1): 517-558 (2022) - 2021
- [j13]Alexandra Anderluh, Pamela C. Nolz, Vera C. Hemmelmayr, Teodor Gabriel Crainic:
Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and 'grey zone' customers arising in urban logistics. Eur. J. Oper. Res. 289(3): 940-958 (2021) - [j12]Florian Martin, Vera C. Hemmelmayr, Tina Wakolbinger:
Integrated express shipment service network design with customer choice and endogenous delivery time restrictions. Eur. J. Oper. Res. 294(2): 590-603 (2021)
2010 – 2019
- 2017
- [j11]Alexandra Anderluh, Vera C. Hemmelmayr, Pamela C. Nolz:
Synchronizing vans and cargo bikes in a city distribution network. Central Eur. J. Oper. Res. 25(2): 345-376 (2017) - 2015
- [j10]Vera C. Hemmelmayr:
Sequential and parallel large neighborhood search algorithms for the periodic location routing problem. Eur. J. Oper. Res. 243(1): 52-60 (2015) - 2014
- [j9]Valentina Cacchiani, Vera C. Hemmelmayr, Fabien Tricoire:
A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discret. Appl. Math. 163: 53-64 (2014) - [j8]Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Daniele Vigo:
Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management. Transp. Sci. 48(1): 103-120 (2014) - 2013
- [j7]Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Stefan Rath:
A heuristic solution method for node routing based solid waste collection problems. J. Heuristics 19(2): 129-156 (2013) - 2012
- [j6]Vera C. Hemmelmayr, Verena Schmid, Christian Blum:
Variable neighbourhood search for the variable sized bin packing problem. Comput. Oper. Res. 39(5): 1097-1108 (2012) - [j5]Claudio Contardo, Vera C. Hemmelmayr, Teodor Gabriel Crainic:
Lower and upper bounds for the two-echelon capacitated location-routing problem. Comput. Oper. Res. 39(12): 3185-3199 (2012) - [j4]Vera C. Hemmelmayr, Jean-François Cordeau, Teodor Gabriel Crainic:
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. Comput. Oper. Res. 39(12): 3215-3228 (2012) - 2010
- [j3]Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh:
Vendor managed inventory for environments with stochastic product usage. Eur. J. Oper. Res. 202(3): 686-695 (2010) - [c1]Christian Blum, Vera C. Hemmelmayr, Hugo Hernández, Verena Schmid:
Hybrid Algorithms for the Variable Sized Bin Packing Problem. Hybrid Metaheuristics 2010: 16-30
2000 – 2009
- 2009
- [j2]Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl:
A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3): 791-802 (2009) - [j1]Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh:
Delivery strategies for blood products supplies. OR Spectr. 31(4): 707-725 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
