Pages that link to "Item:Q811357"
From MaRDI portal
The following pages link to An infeasible (exterior point) simplex algorithm for assignment problems (Q811357):
Displaying 22 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Computational experience with exterior point algorithms for the transportation problem (Q702553) (← links)
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
- Worst case examples of an exterior point algorithm for the assignment problem (Q937404) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm (Q1374385) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- A new efficient primal dual simplex algorithm (Q1868820) (← links)
- A space decomposition-based deterministic algorithm for solving linear optimization problems (Q2306623) (← links)
- An improved initial basis for the simplex algorithm (Q2387247) (← links)
- Advances in discrete optimization (Q2868913) (← links)
- An experimental investigation of a primal–dual exterior point simplexalgorithm (Q2868925) (← links)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)
- On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
