A computationally efficient method for nonlinear multicommodity network flow problems

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199707)29:4<225::AID-NET6>3.0.CO;2-H" /><225::AID-NET6>3.0.CO;2-H 10.1002/(SICI)1097-0037(199707)29:4<225::AID-NET6>3.0.CO;2-HzbMath0882.90038OpenAlexW2075690290MaRDI QIDQ4347278

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<225::aid-net6>3.0.co;2-h

zbMATH Keywords

decompositionsparse matrix techniqueconvex objective functionsnonlinear multicommodity network flow

Mathematics Subject Classification ID

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

Related Items (3)

An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints ⋮ Unnamed Item ⋮ 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