|
by: X. Guan, J. Zhang
Amazon.com's Price: $7.95 Prices subject to change.
Binding: Digital
Format: HTML
Label: Elsevier
Manufacturer: Elsevier
Publication Date: August 01, 2007
Publisher: Elsevier
Studio: Elsevier
Editorial Review:
Product Description:
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
In this paper, we consider a class of inverse constrained bottleneck problems (ICBP). Given two weight vectors w^1 and w^2, the constrained bottleneck problem is to find a solution that minimizes w^1-bottleneck weight subject to a bound constraint on w^2-sum weight. In its inverse problem (ICBP), however, a candidate solution is given, and we wish to modify the two weight vectors under bound restrictions so that the given solution becomes an optimal one to the constrained bottleneck problem and the deviation of the weights under weighted l'~ norm is minimum. When the modifications of the two weight vectors are proportional, we present a general method to solve the problem (ICBP) and give several examples to implement the method including the inverse constrained bottleneck spanning tree problem and the inverse constrained bottleneck assignment problem.
|
![: Inverse constrained bottleneck problems under weighted l'~ norm [An article from: Computers and Operations Research]](http://ecx.images-amazon.com/images/I/41SS7GZHX6L._SL160_.jpg)