A simplex method for uncapacitated pure-supply infinite network flow problems
From MaRDI portal
Publication:3174805
DOI10.1137/17M1137553zbMATH Open1402.90199OpenAlexW2883274460WikidataQ129519664 ScholiaQ129519664MaRDI QIDQ3174805FDOQ3174805
Authors: Christopher Thomas Ryan, Robert L. Smith, Marina Epelman 
Publication date: 18 July 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1137553
Recommendations
Programming involving graphs or networks (90C35) Infinite graphs (05C63) Extreme-point and pivoting methods (90C49)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Infinite dimensional analysis. A hitchhiker's guide.
- Title not available (Why is that?)
- A Duality Theory for Separated Continuous Linear Programs
- Duality in infinite dimensional linear programming
- Finite dimensional approximation in infinite dimensional mathematical programming
- Shadow prices in infinite-dimensional linear programming
- A Shadow Simplex Method for Infinite Linear Programs
- Circumventing the Slater conundrum in countably infinite linear programs
- Extreme point characterizations for infinite network flow problems
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
- Simplex Algorithm for Countable-State Discounted Markov Decision Processes
- Dynamic version of the economic lot size model
- Title not available (Why is that?)
- On the use of purely finitely additive multipliers in mathematical programming
- Title not available (Why is that?)
- The Max-Flow Min-Cut theorem for countable networks
- A network simplex method
- On packing and covering polyhedra in infinite dimensions
- Characterizing extreme points as basic feasible solutions in infinite linear programs
- Duality in Countably Infinite Monotropic Programs
Cited In (9)
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- A Simplex Method for Countably Infinite Linear Programs
- Uncapacitated flow-based extended formulations
- Minimum spanning trees in infinite graphs: theory and algorithms
- Extreme point characterizations for infinite network flow problems
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes
This page was built for publication: A simplex method for uncapacitated pure-supply infinite network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174805)
