Performance evaluation of independent superbasic sets on nonlinear replicated networks

DOI10.1016/0377-2217(86)90300-0MaRDI QIDQ1068689zbMATH OpenOpenAlexFDO

Authors Laureano F. Escudero Bueno

Publication date 1986

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(86)90300-0

zbMATH Keywords

computational performancenetwork flowtransshipmentlinearly constrained nonlinear programmingindependent superbasic setslinking arcsmaximal basis spanning treesnon-differentiable nonlinear functionsreplicated networks

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints
• An efficient method for nonlinearly constrained networks
• scientific article; zbMATH DE number 1057923
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup

Cites work

• scientific article; zbMATH DE number 3952462 (Why is no real title available?)
• scientific article; zbMATH DE number 3246195 (Why is no real title available?)
• A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• An efficient implementation of the network simplex method
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Large-scale linearly constrained optimization
• Multipoint methods for separable nonlinear networks
• Network flow problems with one side constraint: A comparison of three solution methods
• On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
• On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints
• Projected Newton methods and optimization of multicommodity flows
• Truncated-Newton algorithms for large-scale unconstrained optimization
• Two-Segment Separable Programming

Cited in

(4)

• Measuring robustness of superpeer topologies
• On large scale nonlinear network optimization
• Network planning under uncertainty with an application to hydropower generation
• A survey of dynamic network flows

This page was built for publication: Performance evaluation of independent superbasic sets on nonlinear replicated networks

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