Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Network simplex algorithm (view)

searching for Simplex algorithm 13 found (191 total)

Bland's rule (670 words) [view diff] exact match in snippet view article find links to article

With Bland's rule, the simplex algorithm solves feasible linear optimization problems without cycling. The original simplex algorithm starts with an arbitrary

Cunningham's rule (204 words) [view diff] exact match in snippet view article find links to article

Friedmann that there is a family of linear programs on which the simplex algorithm equipped with Cunningham's rule requires exponential time. Cunningham

Zadeh's rule (512 words) [view diff] exact match in snippet view article find links to article

family of history-based improvement rules which, during a run of the simplex algorithm, retain supplementary data in addition to the current basis of the

Routing (hydrology) (1,537 words) [view diff] exact match in snippet view article

Parameter estimation of nonlinear Muskingum models using Nelder-Mead Simplex algorithm. Journal of Hydrologic Engineering, 16(11): 946-954. Cunge J. A (1969)

SPECint (645 words) [view diff] exact match in snippet view article find links to article

mcf C Combinatorial Optimization Vehicle scheduling. Uses a network simplex algorithm (which is also used in commercial products) to schedule public transport

Fulkerson Prize (1,854 words) [view diff] exact match in snippet view article find links to article

Teng, Shang-Hua (2004). "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time". Journal of the ACM. 51: 385–463. arXiv:math/0212413

Unique sink orientation (752 words) [view diff] exact match in snippet view article find links to article

MR 1948744, S2CID 6597643. Gärtner, Bernd (2002), "The Random-Facet simplex algorithm on combinatorial cubes", Random Structures & Algorithms, 20 (3): 353–381

SPECfp (759 words) [view diff] exact match in snippet view article find links to article

Linear Programming, Optimization Solves a linear program using a simplex algorithm and sparse linear algebra. Test simulation include railroad planning

George J. Minty (1,102 words) [view diff] exact match in snippet view article find links to article

1090/S0002-9904-1970-12466-1. MR 0254575. Shisha, Oved, ed. (1972). "How good is the simplex algorithm? by Victor Klee and George Minty". Inequalities III (Proceedings of

Timeline of computational mathematics (1,763 words) [view diff] exact match in snippet view article find links to article

Alamos by von Neumann, Ulam and Metropolis. Dantzig introduces the simplex algorithm (voted one of the top 10 algorithms of the 20th century). First hydro

University of Maryland College of Computer, Mathematical, and Natural Sciences (1,132 words) [view diff] case mismatch in snippet view article find links to article

Theory Prize (1974), National Medal of Science (1975) Developer of the Simplex Algorithm; The Mathematical Programming Society honored Dantzig by creating

Alan J. Hoffman (3,693 words) [view diff] exact match in snippet view article find links to article

widely distributed to other groups working on their own codes for the simplex algorithm. In 2020 this paper is a fascinating glimpse into the challenges of

LP-type problem (4,687 words) [view diff] exact match in snippet view article find links to article

MR 2344393, S2CID 8183965. Kalai, Gil (1992), "A subexponential randomized simplex algorithm", Proc. 24th ACM Symposium on Theory of Computing, pp. 475–482, doi:10