An algorithm for the minimax Weber problem (Q1148779): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29395444, #quickstatements; #temporary_batch_1711015421434 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Efficient Method to Solve the Minimax Problem Directly / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3316922 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approach to nonlinear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria / rank | |||
Normal rank | |||
Latest revision as of 10:23, 13 June 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
