An inverse maximum capacity path problem with lower bound constraints

DOI10.1016/S0252-9602(17)30473-3zbMATH Open1006.90073OpenAlexW2783518218MaRDI QIDQ698900FDOQ698900

Authors: Chao Yang, Xueqi Chen 

Publication date: 12 March 2003

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(17)30473-3

Recommendations

• scientific article; zbMATH DE number 1086909
• Capacity inverse minimum cost flow problem
• Inverse maximum capacity problems
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• The inverse maximum flow problem with lower and upper bounds for the flow

zbMATH Keywords

computational complexityinverse problempolynomial algorithmmaximum capacity path

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Combinatorial optimization (90C27) Inverse problems in optimal control (49N45)

Cited In (4)

• Maximum Capacity Path Interdiction Problem with Fixed Costs
• The inverse maximum flow problem consideringl_∞norm
• Capacity inverse minimum cost flow problem
• On the optimum capacity of capacity expansion problems

This page was built for publication: An inverse maximum capacity path problem with lower bound constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698900)