Some inverse optimization problems on network

DOI10.1007/s11424-013-0259-xzbMath1279.49025OpenAlexW2055613293MaRDI QIDQ394471

Cheng Xu, Xiao-Ming Xu

Publication date: 27 January 2014

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-013-0259-x

zbMATH Keywords

dual problemfractional minimum cost flow problemgain networkinverse optimization problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inverse problems in optimal control (49N45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The fractional minimal cost flow problem on network
• Linear fractional programming and duality
• On an instance of the inverse shortest paths problem
• Inverse problem of minimum cuts
• A further study on inverse linear programming problems
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Inverse combinatorial optimization: a survey on problems, methods, and results
• An inverse problem of the weighted shortest path problem
• Some inverse optimization problems under the Hamming distance
• A Parametric Method for Solving the Linear Fractional Programming Problem
• Inverse maximum flow and minimum cut problems
• A column generation method for inverse shortest path problems
• Fractional programming
• Linear programming. Foundations and extensions

This page was built for publication: Some inverse optimization problems on network