Goldengorin, Boris Sierksma, Gerard (Groningen University)
Abstract
For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and the lower tolerances outside the optimal solution. As a consequence, the calculation of such tolerances can now be done in linear time, while all current methods use quadratic time.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Groningen, Research Institute SOM (Systems, Organisations and Management) in its series Research Report with number
03A30.