An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints

DOI10.1016/j.amc.2007.01.037zbMath1122.65361OpenAlexW2033135743MaRDI QIDQ2383757

Shieh-Shing Lin

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.01.037

zbMATH Keywords

networkalgorithmnumerical examplessuccessive quadratic programming methoddual projected pseudo-quasi-Newton methodgraph method decompositiongraph method decomposition techniquemodified successive projection and truncated techniquenonlinear multi-commodity network flow problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flows in transportation networks
• Optimal Routing in a Packet-Switched Computer Network
• Multicommodity Distribution System Design by Benders Decomposition
• A minimum-cost multicommodity network flow problem concerning imports and exports
• The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks
• An algorithm for nonlinear multicommodity flow problems
• A computationally efficient method for nonlinear multicommodity network flow problems
• The flow deviation method: An approach to store‐and‐forward communication network design
• Traffic assignment problem for a general network
• Minimum cost routing for static network models
• Routing in computer networks

This page was built for publication: An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints