| R. E. Burkard, Y. Lin, and J. Zhang, Weight reduction problems with bottleneck objective, Bericht 218, Spezialforschungsbereich F003 Optimierung und Kontrolle, Karl-FranzensUniversit at Graz and Technische Universitat Graz, 2001, available at ftp://ftp.tu-graz. ac.at/pub/papers/math/sfb218.ps.gz. |
.... Drangmeister, Krumke, Marathe, Noltemeier, Ravi [48] maximum ow problems (see for instance Phillips [64] bottleneck capacity expansion problems (see Yang and Zhang [69] Zhang, Yang, and Lin [70] and Burkard, Klinz, and Zhang [46] and weight reduction problems (see Burkard, Lin, and Zhang [47]) 3 Methods This section presents some of the methods that have been used to solve inverse problems. We will focus on ideas which may be applicable in many problems. 3.1 Linear Programming Based Methods Many inverse problems in the literature are solved by using linear programming methods. ....
R. E. Burkard, Y. Lin, and J. Zhang, Weight reduction problems with bottleneck objective, Bericht 218, Spezialforschungsbereich F003 Optimierung und Kontrolle, Karl-FranzensUniversit at Graz and Technische Universitat Graz, 2001, available at ftp://ftp.tu-graz. ac.at/pub/papers/math/sfb218.ps.gz.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC