An algorithm for the M-Median Plant location problem
| Year of publication: |
1974
|
|---|---|
| Authors: | Garfinkel, R. S. ; Neebe, A. W. ; Rao, M. R. |
| Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 8.1974, 3, p. 217-236
|
| Subject: | Standort | Programming | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Standorttheorie | Location theory | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the maximum capture problem with random utilities
Freire, Alexandre S., (2016)
-
A separation algorithm for the simple plant location problem
Galli, Laura, (2021)
-
Branch-and-bound algorithm for a competitive facility location problem
Beresnev, Vladimir, (2013)
- More ...
-
The m-center problem: Minimax facility location
Garfinkel, R. S., (1977)
-
The m-Center Problem: Minimax Facility Location
Garfinkel, R. S., (1977)
-
The discrete-time sequencing expansion problem
Neebe, A. W., (1983)
- More ...