| 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 | 380 | 2008 |
| 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 | 117 | 2013 |
| 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 | 85 | 2011 |
| 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 | 64* | 2011 |
| Cutting planes for branch‐and‐price algorithms G Desaulniers, J Desrosiers, S Spoorendonk Networks 58 (4), 301-310, 2011 | 49 | 2011 |
| 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 | 46 | 2008 |
| 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 | 35 | 2014 |
| 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 | 34 | 2008 |
| 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 | 26 | 2010 |
| 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 | 25 | 2007 |
| 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 | 24 | 2016 |
| 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 | 24 | 2010 |
| Cut and column generation S Spoorendonk Thèse de doctorat, Faculty of science, University of Copenhagen, 2008 | 17 | 2008 |
| 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 | 16 | 2010 |
| Solving vehicle routing with full container load and time windows LB Reinhardt, S Spoorendonk, D Pisinger International Conference on Computational Logistics, 120-128, 2012 | 15 | 2012 |
| 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 | 3 | 2008 |
| An exact approach for aggregated formulations M Gamst, S Spoorendonk 26th European Conference on Operational Research, 2013 | 2 | 2013 |
| Liner shipping revenue management with repositioning of empty containers B Løfstedt, D Pisinger, S Spoorendonk Department of Computer Science, University of Copenhagen, 2008 | 1 | 2008 |
| Simultaneously exploiting two formulations: An exact benders decomposition approach RM Lusby, M Gamst, S Ropke, S Spoorendonk Computers & Operations Research 123, 105041, 2020 | | 2020 |
| Algoritmerne klarer planlægningen S Spoorendonk | | 2010 |
David PisingerProf., DTU Management, Technical University of Denmark (Adjoint Prof. University of Copenhagen)Verified email at man.dtu.dk
