4 papers
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study
Simon Spoorendonk
We present an open, reproducible branch-and-cut (B&C) algorithm for the capacitated profitable tour problem (CPTP) and its open s-t path variant, the capacity-constrained elementar…
A parallel pull labelling algorithm for the resource constrained shortest path problem
Bjørn Petersen, Simon Spoorendonk
The Resource Constrained Shortest Path Problem (RCSPP) is a fundamental combinatorial optimisation problem in which the goal is to find a least-cost path in a directed graph subjec…
: an extensible C++ library for the shortest path problem with resource constraints
Simon Spoorendonk
We present ( for short), an open-source, header-only C++23 library for the shortest path problem with resource constraints (SPPRC),…
Tree-based formulation for the multi-commodity flow problem
Simon Spoorendonk, Bjørn Petersen
We introduce a tree-based formulation for the minimum-cost multi-commodity flow problem that addresses large-scale instances. The method decomposes the source-based model by repres…