Extreme point characterizations for infinite network flow problems

DOI10.1002/NET.20134MaRDI QIDQ3418208zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

infinite treesinfinite horizon optimizationbasic solutionsextreme point solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

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

Cites work

• Infinite dimensional analysis. A hitchhiker's guide

Cited in

(18)

• Characterizing extreme points as basic feasible solutions in infinite linear programs
• Minimum spanning trees in infinite graphs: theory and algorithms
• Robust optimization in countably infinite linear programs
• Duality in convex minimum cost flow problems on infinite networks and hypernetworks
• Duality for extended infinite monotropic optimization problems
• Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
• Duality in Countably Infinite Monotropic Programs
• On packing and covering polyhedra in infinite dimensions
• Inverse optimization in countably infinite linear programs
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Circumventing the Slater conundrum in countably infinite linear programs
• Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
• On the extremal solutions for capacitated network problems
• A simplex method for countably infinite linear programs
• Solvability in infinite horizon optimization
• Duality for optimization problems with infinite sums
• A simplex method for uncapacitated pure-supply infinite network flow problems
• scientific article; zbMATH DE number 3972631 (Why is no real title available?)

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)