The Capacitated Orienteering Problem


In the Orienteering Problem, we are given an undirected, metric graph G = (V , E), starting and end nodes s, t ∈ V , node profits π : V → N and a length bound D. The goal is to find an s–t path of length at most D that collects maximum profit. The Orienteering Problem is a fundamental network design problem and efficient algorithms for this problem have… (More)
DOI: 10.1016/j.dam.2014.10.001

3 Figures and Tables


  • Presentations referencing similar topics