Linear Programming and Network Flows
Year: 1978
Type: article
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: linear programming, network flow, simplex method, duality, sensitivity analysis, decomposition principle, computational complexity, transportation problem, assignment problem, out-of-kilter algorithm, maximum flow, shortest path, multicommodity flow, network synthesis, convex analysis, polyhedral sets
Open Access status: closed
OpenAlex ID: W2010997912
