Pages that link to "Item:Q3418208"
From MaRDI portal
The following pages link to Extreme point characterizations for infinite network flow problems (Q3418208):
Displaying 17 items.
- Robust optimization in countably infinite linear programs (Q276340) (← links)
- Circumventing the Slater conundrum in countably infinite linear programs (Q319852) (← links)
- Characterizing extreme points as basic feasible solutions in infinite linear programs (Q1002074) (← links)
- Inverse optimization in countably infinite linear programs (Q1785341) (← links)
- Solvability in infinite horizon optimization (Q1785414) (← links)
- On packing and covering polyhedra in infinite dimensions (Q1785750) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- Duality for extended infinite monotropic optimization problems (Q2230946) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- A simplex algorithm for minimum-cost network-flow problems in infinite networks (Q3632966) (← links)
- (Q3738926) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- Duality for Optimization Problems with Infinite Sums (Q5231686) (← links)
- Duality in Countably Infinite Monotropic Programs (Q5359500) (← links)
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces (Q5853565) (← links)
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)
- Minimum spanning trees in infinite graphs: theory and algorithms (Q6622744) (← links)