Stefan Røpke

Industrial and Manufacturing Engineering · 2006–2019

A researcher in the Science corpus: 9 papers; trusts 26 researchers and is trusted by 41 researchers here, as inferred from the citation graph.

Subfields

• Industrial and Manufacturing Engineering — 74 citations into it; #29 of 2,521 by trust here, #215 by citations
• Automotive Engineering — 51 citations into it; #31 of 3,081 by trust here, #791 by citations
• Computer Vision and Pattern Recognition — 20 citations into it; #4,309 of 21,575 by trust here, #9,435 by citations
• Building and Construction — 15 citations into it; #238 of 2,909 by trust here, #1,319 by citations
• Computer Networks and Communications — 9 citations into it
• Transportation — 8 citations into it

Whom Stefan Røpke trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Jean-François Cordeau
2. David Pisinger
3. Paolo Toth
4. Giovanni Righini
5. Joseph B. Kruskal
6. Michael A. Trick
7. Russell W. Bent
8. Andrew Lim
9. Daniele Vigo
10. Gilbert Laporte

Who trusts Stefan Røpke overall

1. David Pisinger
2. Gilbert Laporte
3. Dominik Goeke
4. Thibaut Vidal
5. Jean-François Cordeau
6. Gerardo Berbeglia
7. Michael Schneider
8. Monirehalsadat Mahmoudi
9. David Sacramento
10. Teodor Gabriel Crainic

Papers from Stefan Røpke's perspective

Ordered by how strongly the researchers Stefan Røpke trusts endorse each paper. Same corpus, a different order for every researcher.

1. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (Mathematical programming)
2. The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (INFORMS journal on computing)
3. Branch-and-Price: Column Generation for Solving Huge Integer Programs
4. Optimization by Simulated Annealing
5. Solving the pickup and delivery problem with time windows using reactive tabu search
6. A metaheuristic for the pickup and delivery problem with time windows (Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001)
7. A unified heuristic for a large class of Vehicle Routing Problems with Backhauls (European Journal of Operational Research)
8. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems (Networks)
9. A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows (INFORMS journal on computing)
10. A new branch-and-cut algorithm for the capacitated vehicle routing problem (Mathematical programming)

Their papers

• Large Neighborhood Search (2018) — 598 citations
• The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (2016) — 578 citations
• An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones (2019) — 464 citations
• Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (2009) — 514 citations
• Horizontal cooperation among freight carriers: request allocation and profit sharing (2008) — 361 citations
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (2007) — 308 citations
• A general heuristic for vehicle routing problems (2007) — 1,546 citations
• A unified heuristic for a large class of Vehicle Routing Problems with Backhauls (2006) — 516 citations
• An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006) — 2,548 citations