articleTop 10% cited
Linear Programming and Network Flows
Journal of the Operational Research Society · 1978 · Vol. 29(5) · pp. 510–510
Abstract
One: Introduction.Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.Three: The Simplex Method.Four: Starting Solution and Convergence.Five: Special Simplex Implementations and Optimality Conditions.Six: Duality and Sensitivity Analysis.Seven: The Decomposition Principle.Eight: Complexity of the Simplex Algorithms.Nine: Minimal-Cost Network Flows.Ten: The Transportation and Assignment Problems.Eleven: The Out-of-Kilter Algorithm.Twelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems.Bibliography.Index.
Optimization and Search ProblemsOptimization and Packing ProblemsAdvanced Graph Theory ResearchComputer scienceLinear programmingProject managementOperations researchEconomicsMathematicsManagementAlgorithm
Citations
1,880
FWCI
12.77
field-weighted impact
References
0
Percentile
99%
vs. same field & year
Citations per year
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.