| 書目名稱 | Minimax Under Transportation Constrains |
| 編輯 | Vladimir Tsurkov,Anatoli Mironov |
| 視頻video | http://file.papertrans.cn/635/634613/634613.mp4 |
| 叢書名稱 | Applied Optimization |
| 圖書封面 |  |
| 描述 | Transportation problems belong to the domains mathematical program- ming and operations research. Transportation models are widely applied in various fields. Numerous concrete problems (for example, assignment and distribution problems, maximum-flow problem, etc. ) are formulated as trans- portation problems. Some efficient methods have been developed for solving transportation problems of various types. This monograph is devoted to transportation problems with minimax cri- teria. The classical (linear) transportation problem was posed several decades ago. In this problem, supply and demand points are given, and it is required to minimize the transportation cost. This statement paved the way for numerous extensions and generalizations. In contrast to the original statement of the problem, we consider a min- imax rather than a minimum criterion. In particular, a matrix with the minimal largest element is sought in the class of nonnegative matrices with given sums of row and column elements. In this case, the idea behind the minimax criterion can be interpreted as follows. Suppose that the shipment time from a supply point to a demand point is proportional to the amount to be shipped |
| 出版日期 | Book 1999 |
| 關鍵詞 | Matrix; algorithms; operations research; optimization; vertices; combinatorics; information and communicat |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4615-4060-1 |
| isbn_softcover | 978-1-4613-6818-2 |
| isbn_ebook | 978-1-4615-4060-1Series ISSN 1384-6485 |
| issn_series | 1384-6485 |
| copyright | Springer Science+Business Media Dordrecht 1999 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網安備110108008328)
GMT+8, 2025-10-20 00:59
發(fā)表于 2025-3-21 16:04:33
