Simon Spoorendonk

  1. 2009
  2. Published
  3. Published

    A general framework for branch-and-cut-and-price. / Desrosiers, Jacques (Invited author); Desaulniers, Guy (Invited author); Spoorendonk, Simon (Invited author).

    2009. Abstract from Route 2009, Skodsborg, Denmark, .

    Publication: ResearchConference abstract for conference – Annual report year: 2009

  4. Published

    A general framework for branch-and-cut-and-price. / Desrosiers, Jacques; Desaulniers, Guy; Spoorendonk, Simon.

    2009. Abstract from The Eleventh INFORMS Computing Society (ICS) Conference, Charleston, USA, January 11-13, .

    Publication: Research - peer-reviewConference abstract for conference – Annual report year: 2009

  5. Published

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

    Proceedings of the International Network Optimization Conference (INOC) 2009. 2009. p. 1-7.

    Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2009

  6. Published

    Cutting in Branch-and-cut-and-price Algorithms. / Spoorendonk, Simon (Invited author); Desaulniers, Guy (Invited author); Desrosiers, Jacques (Invited author).

    2009. Abstract from The 20th International Symposium of Mathematical Programming (ISMP), Chicago, USA, .

    Publication: ResearchConference abstract for conference – Annual report year: 2009

  7. Published

    Cutting on the set partitioning formulation of the vehicle routing problem with time windows. / Spoorendonk, Simon (Invited author).

    2009. Abstract from 23rd European Conference on Operational Research, Bonn, Germany.

    Publication: ResearchConference abstract for conference – Annual report year: 2009

  8. Published

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

    GERAD, Montreal, Canada, 2009. (Cahiers du GERAD; No. G-2009-52).

    Publication: ResearchReport – Annual report year: 2009

  9. 2008
  10. 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

  11. Not written here

    A note on the Flow Extended 0-1 Knapsack Cover Inequalities for the Elementary Shortest Path Problem with a Capacity Constraint. / Jepsen, Mads Kehlet; Spoorendonk, Simon.

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

    Publication: ResearchReport – Annual report year: 2008

  12. Not written here

    Chvátal-Gomory Rank-1 Cuts used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows. / Petersen, Bjørn; Pisinger, David; Spoorendonk, Simon.

    The Vehicle Routing Problem: Latest Advances and New Challenges. ed. / B. Golden; R. Raghavan; E. Wasil. Springer, 2008.

    Publication: Research - peer-reviewBook chapter – Annual report year: 2008

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