Inverse optimization in high-speed networks

DOI10.1016/S0166-218X(02)00235-4zbMath1023.68002MaRDI QIDQ1399112

Balázs Szviatovszki, Áron Szentesi, Andras Farago

Publication date: 30 July 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

shortest path problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorial optimization (90C27)

Related Items (7)

Heuristic algorithms for the inverse mixed integer linear programming problem ⋮ Data-driven inverse optimization with imperfect information ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Inverse Optimization with Noisy Data ⋮ Optimization of OSPF Routing in IP Networks ⋮ Some inverse optimization problems under the Hamming distance

Cites Work

• Unnamed Item
• Unnamed Item
• On an instance of the inverse shortest paths problem
• Inverse problem of minimum cuts
• Inverse polymatroidal flow problem
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• An inverse problem of the weighted shortest path problem
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Inverse maximum flow and minimum cut problems
• A column generation method for inverse shortest path problems

This page was built for publication: Inverse optimization in high-speed networks