Pages that link to "Item:Q4199852"

The following pages link to Theoretical Properties of the Network Simplex Method (Q4199852):

Displaying 38 items.

• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
• An exponential lower bound for Cunningham's rule (Q507321) (← links)
• A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
• A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals (Q552189) (← links)
• A least-squares minimum-cost network flow algorithm (Q646641) (← links)
• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• Polynomial dual network simplex algorithms (Q689130) (← links)
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
• The biobjective undirected two-commodity minimum cost flow problem (Q707093) (← links)
• On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
• Modeling the satellite placement problem as a network flow problem with one side constraint (Q751497) (← links)
• New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels (Q839681) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
• Degeneracy in transportation problems (Q1082263) (← links)
• A new family of exponential LP problems (Q1097169) (← links)
• On the solution of highly degenerate linear programmes (Q1106719) (← links)
• A network penalty method (Q1174423) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
• Selected bibliography on degeneracy (Q1312748) (← links)
• Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
• Combinatoric classes of the transportation problem and their properties (Q1312755) (← links)
• A practical anti-degeneracy row selection technique in network linear programming (Q1312776) (← links)
• Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
• A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
• A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
• The biobjective minimum cost flow problem (Q1578006) (← links)
• Improved linear programming methods for checking avoiding sure loss (Q1726250) (← links)
• A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
• A network simplex algorithm with O(\(n\)) consecutive degenerate pivots (Q1866978) (← links)
• On cycling in the network simplex method (Q3664851) (← links)
• Affirmative action algorithms (Q3725860) (← links)
• A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• (Q5111758) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)