Simon Spoorendonk
Simon Spoorendonk
Flowty
Verified email at flowty.ai - Homepage
Title
Cited by
Cited by
Year
Subset-row inequalities applied to the vehicle-routing problem with time windows
M Jepsen, B Petersen, S Spoorendonk, D Pisinger
Operations Research 56 (2), 497, 2008
3512008
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
1082013
Liner Shipping Cargo Allocation with Repositioning of Empty Containers
BD Brouer, D Pisinger, S Spoorendonk
INFOR: Information Systems and Operational Research 49 (2), 109-124, 2011
772011
A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
LF Muller, S Spoorendonk, D Pisinger
European Journal of Operational Research, 2011
63*2011
Cutting planes for branch‐and‐price algorithms
G Desaulniers, J Desrosiers, S Spoorendonk
Networks 58 (4), 301-310, 2011
492011
Chvátal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
B Petersen, D Pisinger, S Spoorendonk
The vehicle routing problem: latest advances and new challenges, 397-419, 2008
452008
A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint
M Jepsen, B Petersen, S Spoorendonk
Department of Computer Science, University of Copenhagen, 2008
322008
A branch-and-cut algorithm for the capacitated profitable tour problem
MK Jepsen, B Petersen, S Spoorendonk, D Pisinger
Discrete Optimization 14, 78-96, 2014
262014
Optimal routing with single backup path protection
T Stidsen, B Petersen, KB Rasmussen, S Spoorendonk, M Zachariasen, ...
Proceedings of the 3rd International Network Optimization Conference (INOC …, 2007
252007
The Vehicle Routing Problem with Time Windows: State‐of‐the‐Art Exact Solution Methods
G Desaulniers, J Desrosiers, S Spoorendonk
Wiley Encyclopedia of Operations Research and Management Science 8, 5742-5749, 2010
242010
Clique inequalities applied to the vehicle routing problem with time windows
S Spoorendonk, G Desaulniers
INFOR: Information Systems and Operational Research 48 (1), 53-67, 2010
232010
Optimization of the drayage problem using exact methods
LB Reinhardt, D Pisinger, S Spoorendonk, MM Sigurd
INFOR: Information Systems and Operational Research 54 (1), 33-51, 2016
182016
Optimal routing with failure‐independent path protection
T Stidsen, B Petersen, S Spoorendonk, M Zachariasen, KB Rasmussen
Networks: An International Journal 55 (2), 125-137, 2010
162010
Solving vehicle routing with full container load and time windows
LB Reinhardt, S Spoorendonk, D Pisinger
International Conference on Computational Logistics, 120-128, 2012
152012
Cut and column generation
S Spoorendonk
Thèse de doctorat, Faculty of science, University of Copenhagen, 2008
152008
A note on the flow extended 0-1 knapsack cover inequalities for the elementary shortest path problem with a capacity constraint
M Jepsen, S Spoorendonk
Technical Report 08-02, DIKU Department of Computer Science, University of …, 2008
32008
An exact approach for aggregated formulations
M Gamst, S Spoorendonk
DTU Management Engineering, 2013
22013
Liner Shipping Revenue Management with Respositioning of Empty Containers
B Løfstedt, D Pisinger, S Spoorendonk
Dept. of Computer Science–University of Copenhagen, 2008
12008
Introducing Subset Row Inequalities in a Branch-and-Cut-and-Price Algorithm for the Vehicle Routing Problem with Time Windows
M Jepsen, B Petersen, S Spoorendonk, D Pisinger
Oper Res. v56, 497-511, 0
1
Simultaneously Exploiting Two Formulations: an Exact Benders Decomposition Approach
RM Lusby, M Gamst, S Ropke, S Spoorendonk
Computers & Operations Research, 105041, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20