Pages that link to "Item:Q3632966"

The following pages link to A simplex algorithm for minimum-cost network-flow problems in infinite networks (Q3632966):

Displaying 12 items.

• Robust optimization in countably infinite linear programs (Q276340) (← links)
• Circumventing the Slater conundrum in countably infinite linear programs (Q319852) (← links)
• Inverse optimization in countably infinite linear programs (Q1785341) (← links)
• Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
• A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829) (← 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 Method for Countably Infinite Linear Programs (Q5020851) (← links)
• Duality in Countably Infinite Monotropic Programs (Q5359500) (← links)
• Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces (Q5853565) (← links)
• Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes (Q6116235) (← links)
• Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)