Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Minmax Regret Median Location on a Network Under Uncertainty

Minmax Regret Median Location on a Network Under Uncertainty We consider the 1-median problem on a network with uncertain weights ofnodes. Specifically, for each node, only an interval estimate of its weight isknown. It is required to find the “minimax regret” location, i.e., tominimize the worst-case loss in the objective function that may occur becausea decision is made without knowing which state of nature will take place. We presentthe first polynomial algorithm for this problem on a general network. For the problem on a tree network, we discuss an algorithm with an order of complexityimproved over the algorithms known in the literature. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png INFORMS Journal on Computing INFORMS

Minmax Regret Median Location on a Network Under Uncertainty

INFORMS Journal on Computing , Volume 12 (2): 7 – May 1, 2000
7 pages

Loading next page...
 
/lp/informs/minmax-regret-median-location-on-a-network-under-uncertainty-TOffDqwS02

References (33)

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
1091-9856
eISSN
1526-5528
DOI
10.1287/ijoc.12.2.104.11897
Publisher site
See Article on Publisher Site

Abstract

We consider the 1-median problem on a network with uncertain weights ofnodes. Specifically, for each node, only an interval estimate of its weight isknown. It is required to find the “minimax regret” location, i.e., tominimize the worst-case loss in the objective function that may occur becausea decision is made without knowing which state of nature will take place. We presentthe first polynomial algorithm for this problem on a general network. For the problem on a tree network, we discuss an algorithm with an order of complexityimproved over the algorithms known in the literature.

Journal

INFORMS Journal on ComputingINFORMS

Published: May 1, 2000

Keywords: Keywords : multifacility location ; complexity ; nc-algorithm

There are no references for this article.