.png){kind=icon}
Return
Improved polynomial algorithms for robust bottleneck problems with interval data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2009.03.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To model uncertainties in a problem one can provide intervals of uncertainty specifying a range for each uncertain parameter value. To hedge against 'worst-case scenarios', i.e., most unwelcome realizations of the uncertain parameters after a solution has been determined, the minmax-regret criterion has been adopted in robust optimization. Within this field, we consider bottleneck problems with one or more uncertain parameter functions. We apply a known polynomial time solution scheme for a number of specific problems of this type with one uncertain parameter function. This leads to improved algorithms of reduced complexity, e.g., for the bottleneck Steiner tree problem and the bottleneck assignment problem. Further, we formulate a framework to solve single machine scheduling problems in polynomial time under the maximum tardiness criterion, with up to three uncertain parameter functions. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Minmax regret
Bottleneck criterion
Interval data
Sequencing
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
.png){kind=icon}
PREAI
ShareSave
ShareSave
View more