Live briefing
Everything about Network simplex algorithm
Algorithm in graph theory
In mathematical optimization, the network simplex algorithm is a graph theoretic specialization of the simplex algorithm. The algorithm is usually formulated in terms of a minimum-cost flow problem. The network simplex method works very well in practice, typically 200 to 300 times faster than the simplex method applied to general linear program of same dimensions. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Network simplex algorithmA 5-minute orientation
- Skim a recent paper: Optimization of Measurement Station Placement for Large-scale 3D Control Network Based on Collision Model and Simplex AlgorithmInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: A polynomial time primal network simplex algorithm for minimum cost flowsCited 179 times
- Go sideways: Minimum-cost flow problemA closely related topic
- Go sideways: Assignment problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A polynomial time primal network simplex algorithm for minimum cost flows
Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
A continuous‐time network simplex algorithm
Polynomial dual network simplex algorithms
The Scaling Network Simplex Algorithm
A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design
Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
A simplex algorithm for minimum‐cost network‐flow problems in infinite networks
🆕 Influential since 2022
📚 Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981
Introduction to operations researchFrederick S. Hillier · 1967
Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000
Graphs, Networks and AlgorithmsDieter Jungnickel · 2006
Neuro-fuzzy and soft computingJyh-Shing Roger Jang, Chuen-Tsai Sun · 1996
Mathematical programming at Oberwolfach IIB. H. Korte, M. L. Balinski · 1984
Polynomial dual network simplex algorithmsJames B. Orlin · 1991- 📕The network simplex algorithmSheng-Roan Kai · 1987
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Minimum-cost flow problem The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through…
- Assignment problem The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has…
- Linear programming Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical…
- Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and…
- Matroid intersection In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If…
- Andrew V. Goldberg Andrew Vladislav Goldberg (born 1960) is an American computer scientist and operations researcher. He is known for algorithms on graphs and networks, including…
- FortMP FortMP is a software package for solving large-scale optimization problems. It solves linear programming problems, quadratic programming problems and mixed…
- Criss-cross algorithm In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm…