A computationally efficient method for nonlinear multicommodity network flow problems

DOI10.1002/(SICI)1097-0037(199707)29:4%3C225::AID-NET6%3E3.0.CO;2-HMaRDI QIDQ4347278zbMATH OpenOpenAlexFDO

Authors Ch'I-Hsien Lin, Shin-Yeu Lin

Publication date 7 August 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199707)29:4%3C225::aid-net6%3E3.0.co;2-h

zbMATH Keywords

convex objective functionsdecompositionnonlinear multicommodity network flowsparse matrix technique

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• A separable nonlinear model for the multicommodity flow problem
• A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
• An implementation of linear and nonlinear multicommodity network flows

Cited in

(17)

• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• On the computation of all supported efficient solutions in multi-objective integer network flow problems
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
• A separable nonlinear model for the multicommodity flow problem
• scientific article; zbMATH DE number 5613782 (Why is no real title available?)
• Multicommodity flow problems with a bounded number of paths: A flow deviation approach
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• Multicommodity network flows: A survey. II: Solution methods
• Monotonicity and conformality in multicommodity network‐flow problems
• scientific article; zbMATH DE number 7071840 (Why is no real title available?)
• An efficient approach to optimization of semi‐stable routing in multicommodity flow networks
• Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system
• An efficient algorithm for state estimation problems with coupling inequality constraints

This page was built for publication: A computationally efficient method for nonlinear multicommodity network flow problems

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