Extreme point characterizations for infinite network flow problems
From MaRDI portal
Publication:3418208
DOI10.1002/NET.20134zbMATH Open1148.90306OpenAlexW4241474317MaRDI QIDQ3418208FDOQ3418208
Authors: H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith 
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/55830
Recommendations
- A simplex method for uncapacitated pure-supply infinite network flow problems
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Extreme Points for Continuous Network Programs with Arc Delays
- Publication:3200865
- Characterizing extreme points as basic feasible solutions in infinite linear programs
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
Cited In (18)
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
- Robust optimization in countably infinite linear programs
- Circumventing the Slater conundrum in countably infinite linear programs
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
- Duality in Countably Infinite Monotropic Programs
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- Characterizing extreme points as basic feasible solutions in infinite linear programs
- On packing and covering polyhedra in infinite dimensions
- Solvability in infinite horizon optimization
- Minimum spanning trees in infinite graphs: theory and algorithms
- Duality for optimization problems with infinite sums
- A simplex method for uncapacitated pure-supply infinite network flow problems
- Duality for extended infinite monotropic optimization problems
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Inverse optimization in countably infinite linear programs
- A simplex method for countably infinite linear programs
- Title not available (Why is that?)
- On the extremal solutions for capacitated network problems
This page was built for publication: Extreme point characterizations for infinite network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418208)
