Time-Constrained Maximal Covering Routing Problem

This site contains accompanying material to the paper

• Mixed-Integer Programming Approaches for the Time-Constrained Maximal Covering Routing Problem

by Markus Sinnl.

Instances

To download the instances used in the paper, click here