Inverse optimization in high-speed networks
From MaRDI portal
Publication:1399112
DOI10.1016/S0166-218X(02)00235-4zbMATH Open1023.68002MaRDI QIDQ1399112FDOQ1399112
Authors: Áron Szentesi, Balázs Szviatovszki, Andras Farago
Publication date: 30 July 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Inverse problem of minimum cuts
- Inverse maximum flow and minimum cut problems
- On an instance of the inverse shortest paths problem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- An inverse problem of the weighted shortest path problem
- Title not available (Why is that?)
- A column generation method for inverse shortest path problems
- Title not available (Why is that?)
- Inverse polymatroidal flow problem
Cited In (11)
- Web services selection based on inverse optimization problems
- Intra-domain traffic engineering with shortest path routing protocols
- Optimization of OSPF routing in IP networks
- On iterative solutions for performance of high-speed switching networks
- An enhanced Benders decomposition method for unique shortest path routing
- Heuristic algorithms for the inverse mixed integer linear programming problem
- Setting Parameters by Example
- Inverse Optimization with Noisy Data
- Intra-domain traffic engineering with shortest path routing protocols
- Some inverse optimization problems under the Hamming distance
- Data-driven inverse optimization with imperfect information
This page was built for publication: Inverse optimization in high-speed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399112)