Inverse optimization in minimum cost flow problems on countably infinite networks
Authors:
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (#CMMI 1561918)
This publication has 19 references indexed in Scilit:
- A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision ProcessesOperations Research, 2013
- Eliciting Patients' Revealed Preferences: An Inverse Markov Decision Process ApproachDecision Analysis, 2010
- A Shadow Simplex Method for Infinite Linear ProgramsOperations Research, 2010
- Characterizing extreme points as basic feasible solutions in infinite linear programsOperations Research Letters, 2009
- A simplex algorithm for minimum‐cost network‐flow problems in infinite networksNetworks, 2008
- Extreme point characterizations for infinite network flow problemsNetworks, 2006
- Inverse OptimizationOperations Research, 2001
- Shadow Prices in Infinite-Dimensional Linear ProgrammingMathematics of Operations Research, 1998
- Duality in infinite dimensional linear programmingMathematical Programming, 1992
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989