scholar.google.com › citations
The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances (the maximum weighted distance) to m given points.
The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances (the maximum ...
The Minisum and Minimax Location Problems. Revisited. PIERRE HANSEN. Institut d'Economie Scientifique et de Gestion, Lille, France, and Faculté Universitaire.
The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances (the maximum ...
The minisum minimax problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances the maximum ...
The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances (the maximum ...
The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances.
The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances (the maximum.
People also ask
What is the difference between Minisum and minimax?
What is the minimax location problem?
TL;DR: This paper considers the problem of locating one new facility with respect to a given set of existing facilities in the plane and in the presence of ...
The minisum and minimax location problems revisited ; Authors: HANSEN, Pierre ; PEETERS, Dominique ; RICHARD, Denis ; THISSE, Jacques-François ; Institutions: ...