Simon Spoorendonk

发表

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 .

Liner Shipping Revenue Management with Respositioning of Empty Containers

David Pisinger, Simon Spoorendonk, Berit Løfstedt, 2008 .

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

David Pisinger, Simon Spoorendonk, Bjørn Petersen, 2008 .

Optimal routing with failure‐independent path protection

Thomas R. Stidsen, Kasper Bonne Rasmussen, Simon Spoorendonk, 2010, Networks.

Cutting planes for branch‐and‐price algorithms

Jacques Desrosiers, Guy Desaulniers, Simon Spoorendonk, 2009, Networks.

A branch-and-cut algorithm for the elementary shortest path problem with resource constraints

Simon Spoorendonk, Mads Kehlet Jepsen, Bjørn Petersen, 2010 .

Simultaneously exploiting two formulations: An exact benders decomposition approach

Simon Spoorendonk, Mette Gamst, Richard Lusby, 2020, Comput. Oper. Res..

Solving a Vehicle Routing Problem with a non-linear load dependant cost function

David Pisinger, Allan Larsen, Simon Spoorendonk, 2011 .

Liner Shipping Cargo Allocation with Repositioning of Empty Containers

David Pisinger, Simon Spoorendonk, Berit D. Brouer, 2011, INFOR Inf. Syst. Oper. Res..

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

Simon Spoorendonk, Stefan Ropke, Mads Jepsen, 2013, Transp. Sci..

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

David Pisinger, Simon Spoorendonk, Bjørn Petersen, 2008, Oper. Res..

Optimal Routing with Single Backup Path Protection

Kasper Bonne Rasmussen, Simon Spoorendonk, Martin Zachariasen, 2007 .

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

Simon Spoorendonk, Bjørn Petersen, Mads Kehlet Jepsen, 2008 .

A non-robust Branch-and-Cut-and-Price algorithm for the Vehicle Routing Problem with Time Windows

David Pisinger, Simon Spoorendonk, Bjørn Petersen, 2006 .

Cut and Column Generation

Simon Spoorendonk, Simon Spoorendonk, 2015 .

Optimization of the drayage problem using exact methods

David Pisinger, Simon Spoorendonk, Line Blander Reinhardt, 2016, INFOR Inf. Syst. Oper. Res..

Optimal routing with failure-independent path protection

Kasper Bonne Rasmussen, Simon Spoorendonk, Martin Zachariasen, 2010 .

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

David Pisinger, Simon Spoorendonk, Laurent Flindt Muller, 2012, Eur. J. Oper. Res..

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

David Pisinger, Simon Spoorendonk, Bjørn Petersen, 2014, Discret. Optim..

The Vehicle Routing Problem with Time Windows: State-of-the-Art Exact Solution Methods

Jacques Desrosiers, Guy Desaulniers, Simon Spoorendonk, 2010 .

Solving Vehicle Routing with Full Container Load and Time Windows

David Pisinger, Simon Spoorendonk, Line Blander Reinhardt, 2012, ICCL.

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

Simon Spoorendonk, Stefan Ropke, Mads Kehlet Jepsen, 2010 .

A branch-and-cut-and-price framework for vehicle routing problems

Simon Spoorendonk, Bjørn Petersen, Mads Kehlet Jepsen, 2009 .

Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows

Guy Desaulniers, Simon Spoorendonk, 2010, INFOR Inf. Syst. Oper. Res..

A note on the Flow Extended 0-1 Knapsack Cover Inequalities for the Elementary Shortest Path Problem with a Capacity Constraint

Simon Spoorendonk, Mads Kehlet Jepsen, 2008 .

Introducing Subset Row Inequalities in a Branch-and-Cut-and-Price Algorithm for the Vehicle Routing Problem with Time Windows

David Pisinger, Simon Spoorendonk, Bjørn Petersen, .