Results 1 
1 of
1
Complexity of determining exact tolerances for minmax combinatorial optimization problems
 University of Groningen
, 2000
"... SOMtheme A Primary Processes within Firms Suppose that we are given an instance of a combinatorial optimization problem with minmax objective along with an optimal solution for it. Let the cost of a single element be varied. We refer to the range of values of the elementâ€™s cost for which the given ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
SOMtheme A Primary Processes within Firms Suppose that we are given an instance of a combinatorial optimization problem with minmax objective along with an optimal solution for it. Let the cost of a single element be varied. We refer to the range of values of the elementâ€™s cost for which the given optimal solution remains optimal as its exact tolerance. In this paper we examine the problem of determining the exact tolerance of each element in combinatorial optimization problems with minmax objectives. We show that under very weak assumptions, the exact tolerance of each element can be determined in polynomial time if and only if the original optimization problem can be solved in polynomial time.