Stefan Ropke
TitleCited byYear
A general heuristic for vehicle routing problems
D Pisinger, S Ropke
Computers & operations research 34 (8), 2403-2435, 2007
12492007
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
S Ropke, D Pisinger
Transportation science 40 (4), 455-472, 2006
12002006
A unified heuristic for a large class of vehicle routing problems with backhauls
S Ropke, D Pisinger
European Journal of Operational Research 171 (3), 750-775, 2006
4302006
Large neighborhood search
D Pisinger, S Ropke
Handbook of metaheuristics, 399-419, 2010
4022010
Branch and cut and price for the pickup and delivery problem with time windows
S Ropke, JF Cordeau
Transportation Science 43 (3), 267-286, 2009
3302009
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
S Ropke, JF Cordeau, G Laporte
Networks: An International Journal 49 (4), 258-272, 2007
3202007
Horizontal cooperation among freight carriers: request allocation and profit sharing
MA Krajewska, H Kopfer, G Laporte, S Ropke, G Zaccour
Journal of the Operational Research Society 59 (11), 1483-1491, 2007
3052007
The electric fleet size and mix vehicle routing problem with time windows and recharging stations
G Hiermann, J Puchinger, S Ropke, RF Hartl
European Journal of Operational Research 252 (3), 995-1018, 2016
2012016
Models for the discrete berth allocation problem: A computational comparison
K Buhrkal, S Zuglian, S Ropke, J Larsen, R Lusby
Transportation Research Part E: Logistics and Transportation Review 47 (4 …, 2011
1562011
The waste collection vehicle routing problem with time windows in a city logistics context
K Buhrkal, A Larsen, S Ropke
Procedia-Social and Behavioral Sciences 39, 241-254, 2012
1322012
Scheduling technicians and tasks in a telecommunications company
JF Cordeau, G Laporte, F Pasin, S Ropke
Journal of Scheduling 13 (4), 393-409, 2010
1282010
Recent models and algorithms for one-to-one pickup and delivery problems
JF Cordeau, G Laporte, S Ropke
The vehicle routing problem: latest advances and new challenges, 327-357, 2008
1032008
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
I Dumitrescu, S Ropke, JF Cordeau, G Laporte
Mathematical Programming 121 (2), 269, 2010
982010
Chapter 5: The vehicle routing problem with time windows
G Desaulniers, OBG Madsen, S Ropke
Vehicle Routing: Problems, Methods, and Applications, Second Edition, 119-159, 2014
972014
A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem
M Jepsen, S Spoorendonk, S Ropke
Transportation Science 47 (1), 23-37, 2013
962013
Heuristic and exact algorithms for vehicle routing problems
S Røpke
862006
Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
T Bektaş, G Erdoğan, S Røpke
Transportation Science 45 (3), 299-316, 2011
852011
Modeling and solving a multimodal transportation problem with flexible‐time and scheduled services
L Moccia, JF Cordeau, G Laporte, S Ropke, MP Valentini
Networks 57 (1), 53-68, 2011
762011
Branch and price for the time-dependent vehicle routing problem with time windows
S Dabia, S Ropke, T Van Woensel, T De Kok
Transportation science 47 (3), 380-396, 2013
722013
Chapter 4: heuristics for the vehicle routing problem
G Laporte, S Ropke, T Vidal
Vehicle Routing: Problems, Methods, and Applications, Second Edition, 87-116, 2014
672014
The system can't perform the operation now. Try again later.
Articles 1–20