The maximum covering/shortest path problem: A multiobjective network design and routing formulation (Q1060958)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3910136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum covering/shortest path problem: A multiobjective network design and routing formulation |
scientific article; zbMATH DE number 3910136 |
Statements
The maximum covering/shortest path problem: A multiobjective network design and routing formulation (English)
0 references
1985
0 references
The authors introduce the maximum covering/shortest path problem and the maximum population/shortest path problem, a special case of the former model. Both models are formulated as two objective integer programs. A summary of the results of a sample problem for the latter formulation is given. Possible modifications to, and extension and applications of both models are also presented. With these formulations the authors extend the concept of 'coverage' from facility location analysis to network design and routing analysis.
0 references
general transportation
0 references
maximum covering/shortest path problem
0 references
maximum population/shortest path problem
0 references
two objective integer programs
0 references
network design
0 references
routing analysis
0 references
0 references
0.7796803116798401
0 references
0.7750893235206604
0 references
0.7703117728233337
0 references
0.7578204870223999
0 references
