A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES (Q3705191): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.15807/jorsj.28.269 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2726448539 / rank | |||
Normal rank | |||
Latest revision as of 23:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES |
scientific article |
Statements
A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES (English)
0 references
1985
0 references
multifacility minimax location problem
0 references
rectilinear distances
0 references
parametric shortest path problem
0 references
network with no negative arc lengths
0 references
