An algorithm for the minimax Weber problem (Q1148779): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q29395444, #quickstatements; #temporary_batch_1711015421434 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29395444 / rank | |||
Normal rank | |||
Revision as of 11:10, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the minimax Weber problem |
scientific article |
Statements
An algorithm for the minimax Weber problem (English)
0 references
1981
0 references
minimax Weber problem
0 references
logistics
0 references
minimax location
0 references
weighted absolute center
0 references
Euclidean plane
0 references
algorithm
0 references
implementation
0 references
method of feasible directions
0 references
proof of convergence
0 references
computational experience
0 references
FORTRAN
0 references
