Restricted simplicial decomposition with side constraints

DOI10.1002/NET.3230260405MaRDI QIDQ4894858zbMATH OpenOpenAlexFDO

Authors Angel Marín

Publication date 23 February 1997

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230260405

zbMATH Keywords

global convergencelarge-scale nonlinear problemsprice decompositionrestricted simplicial decomposition with side constraints

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Recommendations

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

Cites work

• A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• Restricted simplicial decomposition: Computation and extensions

Cited in

(5)

• Finiteness in restricted simplicial decomposition
• 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 for Symmetric Convex Cost Flow Problems
• Simplicial Decomposition for Convex Generalized Networks

This page was built for publication: Restricted simplicial decomposition with side constraints

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