An efficient computational procedure for solving the multi-facility rectilinear facilities location problem
| Year of publication: |
1976
|
|---|---|
| Authors: | Jül, H. ; Love, R. F. |
| Published in: |
Operational research quarterly : OR. - London [u.a.] : [Verlag nicht ermittelbar], ISSN 0030-3623, ZDB-ID 207376-6. - Vol. 27.1976, 3/2, p. 697-703
|
| Subject: | Standort | Theorie | Theory | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming |
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
-
A column generation heuristics for congested facility location problem with clearing functions
Kim, S., (2013)
-
Using ℓp-norms for fairness in combinatorial optimisation
Bektaş, Tolga, (2020)
- More ...
-
The optimal location of new facilities using rectangular distances
Love, R. F., (1971)
-
A nonlinear approximation method for solving a generalized rectangular distance Weber problem
Wesolowsky, G. O., (1972)
-
A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
Wesolowsky, G. O., (1972)
- More ...