Pages that link to "Item:Q492840"
From MaRDI portal
The following pages link to Exterior point simplex-type algorithms for linear and network optimization problems (Q492840):
Displaying 9 items.
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Computational experience with exterior point algorithms for the transportation problem (Q702553) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- An exterior point method for the convex programming problem (Q1321136) (← links)
- A space decomposition-based deterministic algorithm for solving linear optimization problems (Q2306623) (← links)
- (Q3827812) (← links)
- (Q4319602) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)