Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems

DOI10.1080/01966324.1992.10737340MaRDI QIDQ4695015zbMATH OpenOpenAlexWikidataFDO

Authors Jose 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

large-scale electrical networksrestricted simplicial decompositionspanning treeunrestricted arc flowswater distribution

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Restricted simplicial decomposition: Computation and extensions
• Restricted simplicial decomposition with side constraints
• Restricted simplicial decomposition for convex constrained problems
• Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
• Simplicial Decomposition for Convex Generalized Networks

Cites work

• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• A unified framework for primal-dual methods in minimum cost network flow problems
• Finiteness in restricted simplicial decomposition
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 3248502 (Why is no real title available?)
• Multipoint methods for separable nonlinear networks
• On the Goldstein-Levitin-Polyak gradient projection method
• Optimal Routing in a Packet-Switched Computer Network
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Restricted simplicial decomposition: Computation and extensions
• Simplicial decomposition in nonlinear programming algorithms
• Solving the Pipe Network Analysis Problem Using Optimization Techniques

Cited in

(5)

• Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
• Restricted simplicial decomposition for convex constrained problems
• Restricted simplicial decomposition: Computation and extensions
• Simplicial Decomposition for Convex Generalized Networks
• Restricted simplicial decomposition with side constraints

This page was built for publication: Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695015)