Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems

DOI10.1080/01966324.1992.10737340zbMath0780.90042OpenAlexW1974429924WikidataQ58117372 ScholiaQ58117372MaRDI QIDQ4695015

José A. Ventura, Donald W. Hearn

Publication date: 17 August 1993

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1992.10737340

zbMATH Keywords

spanning treewater distributionrestricted simplicial decompositionlarge-scale electrical networksunrestricted arc flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Finiteness in restricted simplicial decomposition
• Multipoint methods for separable nonlinear networks
• A unified framework for primal-dual methods in minimum cost network flow problems
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• Restricted simplicial decomposition: Computation and extensions
• Optimal Routing in a Packet-Switched Computer Network
• On the Goldstein-Levitin-Polyak gradient projection method
• Simplicial decomposition in nonlinear programming algorithms
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Projected Newton Methods for Optimization Problems with Simple Constraints