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

DOI10.1016/J.AMC.2007.01.037MaRDI QIDQ2383757zbMATH OpenOpenAlexFDO

Authors 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

algorithmdual projected pseudo-quasi-Newton methodgraph method decompositiongraph method decomposition techniquemodified successive projection and truncated techniquenetworknonlinear multi-commodity network flow problemsnumerical examplessuccessive quadratic programming method

Mathematics Subject Classification ID

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

Recommendations

• A dual descent algorithm for node-capacitated multiflow problems and its applications
• Efficient algorithms for dualizing large-scale hypergraphs
• Efficient algorithms for dualizing large-scale hypergraphs
• Approximation algorithms for multi-parameter graph optimization problems
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
• Dual parameterization and parameterized approximability of subset graph problems
• A dual graph algorithm model and its implementation of the maximum flow on the large-scale networks
• Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
• On the solution of a graph partitioning problem under capacity constraints
• An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints

Cites work

• A computationally efficient method for nonlinear multicommodity network flow problems
• A minimum-cost multicommodity network flow problem concerning imports and exports
• An algorithm for nonlinear multicommodity flow problems
• Flows in transportation networks
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 42739 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3543771 (Why is no real title available?)
• scientific article; zbMATH DE number 3543772 (Why is no real title available?)
• Minimum cost routing for static network models
• Multicommodity Distribution System Design by Benders Decomposition
• Optimal Routing in a Packet-Switched Computer Network
• Routing in computer networks
• The flow deviation method: An approach to store‐and‐forward communication network design
• The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks
• Traffic assignment problem for a general network

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

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