An efficient branch and bound algorithm for the warenhouse location problem
| Year of publication: |
1972
|
|---|---|
| Authors: | Khumawala, Basheer M. |
| Published in: |
Management science : journal of the Institute of Management Sciences ; application and theory. - Baltimore, Md. [u.a.] : [Verlag nicht ermittelbar], ZDB-ID 206347-5. - Vol. 18.1972, 12, p. B718-B733
|
| Subject: | Standort | Programming | Lagerhaltung | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Betriebliche Standortwahl | Firm location choice | Operations Research | Operations research | Algorithmus | Algorithm |
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
-
Ozturk, Onur, (2017)
-
An algorithm for the M-Median Plant location problem
Garfinkel, R. S., (1974)
- More ...
-
Arostegui, Marvin Jr., (2006)
-
An efficient heuristic procedure for the single-item, discrete lot sizing problem
Canel, Cem, (1996)
-
A simulation study of focused cellular manufacturing as an alternative batch-processing layout
Al-Mubarak, Fahad, (2003)
- More ...