DOI10.1287/moor.4.2.196zbMath0412.90068OpenAlexW2073264848MaRDI QIDQ4199852
William H. Cunningham
Publication date: 1979
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.4.2.196
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm,
Degeneracy in transportation problems,
New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels,
A new family of exponential LP problems,
Affirmative action algorithms,
A competitive (dual) simplex method for the assignment problem,
On the solution of highly degenerate linear programmes,
A new pivot selection rule for the network simplex algorithm,
A simplex algorithm for a class of Leontief flow problems,
An exponential lower bound for Zadeh's pivot rule,
A survey of dynamic network flows,
A least-squares minimum-cost network flow algorithm,
Improved linear programming methods for checking avoiding sure loss,
A network penalty method,
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs,
An exponential lower bound for Cunningham's rule,
Polynomial-time primal simplex algorithms for the minimum cost network flow problem,
A network simplex method for the budget-constrained minimum cost flow problem,
A genuinely polynomial primal simplex algorithm for the assignment problem,
Polynomial dual network simplex algorithms,
Efficient solutions for the bicriteria network flow problem,
A specialized network simplex algorithm for the constrained maximum flow problem,
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses,
A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals,
The biobjective undirected two-commodity minimum cost flow problem,
On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes,
A strongly polynomial simplex method for the linear fractional assignment problem,
Unnamed Item,
Modeling the satellite placement problem as a network flow problem with one side constraint,
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg,
The biobjective minimum cost flow problem,
On cycling in the network simplex method,
Selected bibliography on degeneracy,
Degeneracy graphs: Theory and applications. An updated survey,
Combinatoric classes of the transportation problem and their properties,
A practical anti-degeneracy row selection technique in network linear programming,
A comprehensive simplex-like algorithm for network optimization and perturbation analysis,
A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
