Vera C. Hemmelmayr
Industrial and Manufacturing Engineering · 2009–2012
A researcher in the Science corpus: 2 papers; trusts 10 researchers and is trusted by 7 researchers here, as inferred from the citation graph.
Subfields
- Industrial and Manufacturing Engineering — 8 citations into it; #622 of 2,521 by trust here, #1,171 by citations
- Automotive Engineering — 5 citations into it; #1,968 of 3,081 by trust here, #2,499 by citations
Whom Vera C. Hemmelmayr trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Stefan Røpke
- David Pisinger
- Olli Bräysy
- Christian Prins
- Gábor Zsolt Nagy
- Teodor Gabriel Crainic
- Caroline Prodhon
- Saïd Salhi
- Nicoletta Ricciardi
- Shih-Wei Lin
Who trusts Vera C. Hemmelmayr overall
- Michael Schneider
- Dominik Goeke
- Michael Drexl
- R. Cuda
- Gianfranco Guastaroba
- Andreas Stenger
- Thibaut Vidal
Papers from Vera C. Hemmelmayr's perspective
Ordered by how strongly the researchers Vera C. Hemmelmayr trusts endorse each paper. Same corpus, a different order for every researcher.
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows (INFORMS journal on computing)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (4OR)
- Optimization by Simulated Annealing
- Location-routing: Issues, models and methods (European Journal of Operational Research)
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (INFORMS journal on computing)
- Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic (Transportation Science)
- Models for Evaluating and Planning City Logistics Systems (Transportation Science)
- A simulated annealing heuristic for the capacitated location routing problem (Computers & industrial engineering)
- A general heuristic for vehicle routing problems (Computers & Operations Research)
- An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (Transportation Science)
Their papers
- An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics (2012) — 534 citations
- A variable neighborhood search heuristic for periodic routing problems (2009) — 334 citations