![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Annals of Operations Research, Volume 110
Volume 110, Numbers 1-4, February 2002
- Oded Berman, Dmitry Krass:
Recent Developments in the Theory and Applications of Location Models: A Preview. 15-16 - Ranganath Nuggehalli, Timothy J. Lowe, James E. Ward:
An Improved Lower Bound for the Multimedian Location Problem. 17-31 - Horst W. Hamacher, Martine Labbé
, Stefan Nickel, Anders J. V. Skriver:
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. 33-53 - Igor Averbakh, Oded Berman:
Minmax p-Traveling Salesmen Location Problems on a Tree. 55-68 - Rainer E. Burkard, Helidon Dollani:
A Note on the Robust 1-Center Problem on Trees. 69-82 - Mark S. Daskin
, Collette R. Coullard, Zuo-Jun Max Shen
:
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results. 83-106 - John G. Klincewicz
:
Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale. 107-122 - Vedat Verter, Sophie D. Lapierre:
Location of Preventive Health Care Facilities. 123-132 - James W. George, Charles S. Revelle, John R. Current:
The Maximum Utilization Subtree Problem. 133-151 - M. John Hodgson:
Data Surrogation Error in p-Median Models. 153-165 - Wlodzimierz Ogryczak
, Mariusz Zawadzki:
Conditional Median: A Parametric Solution Concept for Location Problems. 167-181
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.