Автор |
Elzinga, D. J. |
Автор |
Hearn, D. W. |
Дата выпуска |
1983 |
dc.description |
AbstractTwo different lower bounds on the objective values of certain location problems have recently been proposed. Such bounds are useful for finite termination of an algorithm. It has been previously established that one of these bounds is superior to the other. Here we present some extensions and prove that a generalized version of the result is also true. |
Формат |
application.pdf |
Издатель |
Taylor & Francis Group |
Копирайт |
Copyright Taylor and Francis Group, LLC |
Название |
On Stopping Rules for Facilities Location Algorithms |
Тип |
research-article |
DOI |
10.1080/05695558308974616 |
Electronic ISSN |
1545-8830 |
Print ISSN |
0740-817X |
Журнал |
IIE Transactions |
Том |
15 |
Первая страница |
81 |
Последняя страница |
83 |
Аффилиация |
Elzinga, D. J.; Department of Industrial and Systems Engineering, University of Florida |
Аффилиация |
Hearn, D. W.; Department of Industrial and Systems Engineering, University of Florida |
Выпуск |
1 |