Simon Spoorendonk

According to our database1, Simon Spoorendonk authored at least 11 papers between 2008 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Simultaneously exploiting two formulations: An exact benders decomposition approach.
Comput. Oper. Res., 2020

2016
Optimization of the drayage problem using exact methods.
INFOR Inf. Syst. Oper. Res., 2016

2014
A branch-and-cut algorithm for the capacitated profitable tour problem.
Discret. Optim., 2014

2013
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem.
Transp. Sci., 2013

2012
A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times.
Eur. J. Oper. Res., 2012

Solving Vehicle Routing with Full Container Load and Time Windows.
Proceedings of the Computational Logistics - Third International Conference, 2012

2011
Cutting planes for branch-and-price algorithms.
Networks, 2011

Liner Shipping Cargo Allocation with Repositioning of Empty Containers.
INFOR Inf. Syst. Oper. Res., 2011

2010
Optimal routing with failure-independent path protection.
Networks, 2010

Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows.
INFOR Inf. Syst. Oper. Res., 2010

2008
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows.
Oper. Res., 2008


  Loading...