Simon Spoorendonk

  1. Research › Journal article
  2. Published

    A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. / Jepsen, Mads Kehlet; Spoorendonk, Simon; Røpke, Stefan.

    In: Transportation Science, Vol. 47, 02.2013, p. 23-37.

    Publication: Research - peer-reviewJournal article – Annual report year: 2013

  3. Published
  4. Published

    A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. / Muller, Laurent Flindt; Spoorendonk, Simon; Pisinger, David.

    In: European Journal of Operational Research, Vol. 218, No. 3, 2012, p. 614-623.

    Publication: Research - peer-reviewJournal article – Annual report year: 2012

  5. Published

    Clique inequalities applied to the vehicle routing problem with time windows. / Spoorendonk, Simon; Desaulniers, Guy.

    In: I N F O R Journal, Vol. 48, No. 1, 02.2010, p. 53-67.

    Publication: Research - peer-reviewJournal article – Annual report year: 2010

  6. Published

    Cutting Planes for Branch-and-Price Algorithms. / Desaulniers, Guy; Desrosiers, Jacques; Spoorendonk, Simon.

    In: Networks, Vol. 58, No. 4, 11.2011, p. 301-310.

    Publication: Research - peer-reviewJournal article – Annual report year: 2011

  7. Published

    Liner Shipping Cargo Allocation with Repositioning of Empty Containers. / Brouer, Berit Dangaard; Pisinger, David; Spoorendonk, Simon.

    In: I N F O R Journal, Vol. 49, No. 2, 2011, p. 109-124.

    Publication: Research - peer-reviewJournal article – Annual report year: 2011

  8. Published

    Optimal Routing with Failure-Independent Path Protection. / Stidsen, Thomas Riis; Petersen, Bjørn; Spoorendonk, Simon; Zachariasen, Martin; Rasmussen, Kasper Bonne.

    In: Networks (New York), Vol. 55, No. 2, 2010, p. 125-137.

    Publication: Research - peer-reviewJournal article – Annual report year: 2010

  9. Research › Conference article
  10. Published

    Solving Vehicle Routing with Full Container Load and Time Windows. / Reinhardt, Line Blander; Spoorendonk, Simon; Pisinger, David.

    In: Lecture Notes in Computer Science, Vol. 7555, 2012, p. 120-128.

    Publication: Research - peer-reviewConference article – Annual report year: 2012

  11. Research › Report
  12. Not written here

    A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint. / Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon.

    DIKU, University of Copenhagen, Denmark, 2008. (Technical Report; No. 08-01).

    Publication: ResearchReport – Annual report year: 2008

  13. Published

    A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem. / Muller, Laurent Flindt; Spoorendonk, Simon.

    Kgs. Lyngby : DTU Management, 2010. 12 p. (DTU Management 2010; No. 1).

    Publication: ResearchReport – Annual report year: 2010

Previous 1 2 3 4 Next
Download list:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word