Simon Spoorendonk

University of Copenhagen

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers24 papers

Sort

By YearBy Citation

Simultaneously exploiting two formulations: An exact benders decomposition approach

Richard Martin Lusby, Mette Gamst,Stefan Ropke,Simon Spoorendonk

Computers & Operations Research, (2020): 105041

EIBibtex

Optimization of the drayage problem using exact methods

Line Blander Reinhardt,David Pisinger,Simon Spoorendonk,Mikkel M. Sigurd

INFOR, no. 1 (2016): 33-51

EIBibtex

A branch-and-cut algorithm for the capacitated profitable tour problem

Mads Kehlet Jepsen,Bjørn Petersen,Simon Spoorendonk,David Pisinger

Discrete Optimization, (2014): 78-96

Cited by14EIBibtex

A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem

Mads Jepsen,Simon Spoorendonk,Stefan Ropke

Transportation Science, no. 1 (2013): 23-37

Cited by68EIBibtex

Solving vehicle routing with full container load and time windows

Line Blander Reinhardt,Simon Spoorendonk,David Pisinger

ICCL, pp.120-128, (2012)

Cited by12EIBibtex

An exact approach for aggregated formulations

Mette Gamst,Simon Spoorendonk,Stefan Ropke

(2012)

Cited by2Bibtex

A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times

Laurent Flindt Muller,Simon Spoorendonk,David Pisinger

European Journal of Operational Research, no. 3 (2012): 614-623

Cited by48EIBibtex

Liner Shipping Cargo Allocation with Repositioning of Empty Containers

Berit D. Brouer,David Pisinger,Simon Spoorendonk

INFOR, no. 2 (2011): 109-124

Cited by63EIBibtex

Cutting planes for branch-and-price algorithms

Guy Desaulniers,Jacques Desrosiers,Simon Spoorendonk

Networks, no. 4 (2011): 301-310

Cited by40EIBibtex

Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows

Simon Spoorendonk,Guy Desaulniers

INFOR, no. 1 (2010): 53-67

Cited by18EIBibtex

A new formulation for the 2-echelon capacitated vehicle routing problem

Mads Kehlet Jepsen, Stefan Ropke,Simon Spoorendonk

(2010)

Bibtex

Hierachical Two-Layer Ring Network Design

Simon Spoorendonk, Thomas Riis Stidsen,Mads Kehlet Jepsen

(2010)

Bibtex

A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem

Laurent Flindt Muller,Simon Spoorendonk

(2010)

Cited by5Bibtex

Optimal routing with failure-independent path protection

Thomas Stidsen,Bjørn Petersen,Simon Spoorendonk,Martin Zachariasen,Kasper Bonne Rasmussen

Networks, no. 2 (2010): 125-137

Cited by13EIBibtex

Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Mads Jepsen,Bjørn Petersen,Simon Spoorendonk,David Pisinger

Operations Research, no. 2 (2008): 497-511

Cited by271EIBibtex

A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint

Mads Kehlet Jepsen,Bjørn Petersen,Simon Spoorendonk

(2008)

Cited by29Bibtex

Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows

Bjørn Petersen,David Pisinger,Simon Spoorendonk

(2008)

Cited by36Bibtex

Optimal Routing with Single Backup Path Protection

Thomas Stidsen,Kasper Bonne Rasmussen,Simon Spoorendonk,Moritz Kiese

(2007)

Cited by24Bibtex

How to use Chvatal-Gomory Rank-1 Cuts in a Set Partitioning Master Problem of a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows

Simon Spoorendonk

(2007)

Bibtex

A Non-Robust Branch-And-Cut-And-Price Algorithm for the Vehicle Routing Problem with Time Windows

Mads Kehlet Jepsen, Bjorn Petersen,Simon Spoorendonk,David Pisinger

(2006)

Cited by29Bibtex

View All

Base Info Papers Patents Projects