A network location-allocation model trading off flow capturing and \(p\)- median objectives (Q689248): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiobjective programming and planning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of two dual-based procedures for solving the p-median problem / rank | |||
Normal rank | |||
Revision as of 11:38, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A network location-allocation model trading off flow capturing and \(p\)- median objectives |
scientific article |
Statements
A network location-allocation model trading off flow capturing and \(p\)- median objectives (English)
0 references
17 February 1994
0 references
flow capturing
0 references
\(p\)-median location-allocation models
0 references
demand for service in a network
0 references
0 references
