A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A minimum cost network flow model for the maximum covering and patrol routing problem |
scientific article; zbMATH DE number 6633726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimum cost network flow model for the maximum covering and patrol routing problem |
scientific article; zbMATH DE number 6633726 |
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
0.8972342
0 references
0.8935538
0 references
0.8894492
0 references
0.87946326
0 references
0.87208056
0 references
0 references
0.87147117
0 references
0.87111187
0 references
