Inverse optimization in high-speed networks
- 1 June 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 129 (1) , 83-98
- https://doi.org/10.1016/s0166-218x(02)00235-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Inverse problem of minimum cutsMathematical Methods of Operations Research, 1998
- The inverse shortest paths problem with upper bounds on shortest paths costsPublished by Springer Nature ,1997
- Inverse maximum flow and minimum cut problemsOptimization, 1997
- Broadband Network TrafficPublished by Springer Nature ,1996
- A column generation method for inverse shortest path problemsMathematical Methods of Operations Research, 1995
- An inverse problem of the weighted shortest path problemJapan Journal of Industrial and Applied Mathematics, 1995
- A new degree of freedom in ATM network dimensioning: optimizing the logical configurationIEEE Journal on Selected Areas in Communications, 1995
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costsMathematical Programming, 1994
- On an instance of the inverse shortest paths problemMathematical Programming, 1992
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear ProgramsOperations Research, 1986