A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimum cost network flow model for the maximum covering and patrol routing problem |
scientific article |
Statements
A minimum cost network flow model for the maximum covering and patrol routing problem (English)
0 references
6 October 2016
0 references
routing
0 references
problem structuring
0 references
minimum cost network flow problem
0 references
multi-commodity
0 references
