Inverse optimization in minimum cost flow problems on countably infinite networks

Keyphrases

• Minimum Cost Flow Problem 100%
• Inverse Optimization 100%
• Infinite Networks 100%
• Finite-dimensional 50%
• Truncation 50%
• Solution Method 25%
• Polynomial Time 25%
• Computationally Efficient 25%
• Finite Networks 25%
• Simplex Method 25%
• Feasible Solution 25%
• Infinite Horizon 25%
• Shortest Path Problem 25%
• Capacitated 25%
• Duality Results 25%
• Infinite-dimensional Linear Programming 25%
• Cost Vector 25%
• Network Simplex Algorithm 25%
• Absolute Sums 25%
• Minimum-cost Circulation 25%

Mathematics

• Truncation 100%
• Sufficient Condition 50%
• Feasible Solution 50%
• Path Problem 50%
• Simplex Algorithm 50%
• Polynomial Time 50%
• Simplex Method 50%
• Linear Program 50%
• Closeness 50%