Minimax regret p-center location on a network with demand uncertainty

Authors: Averbakh I.1; Berman O.

Source: Location Science, Volume 5, Number 4, December 1997 , pp. 247-254(8)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Keywords: robust optimization; p-center problems; polynomial algorithms

Language: English

Document Type: Research article

DOI: 10.1016/S0966-8349(98)00033-3

Affiliations: 1: Mathematics Department, MS-9063, Western Washington University, Bellingham, WA 98225-9063, USA

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A