An implementation of linear and nonlinear multicommodity network flows

DOI10.1016/0377-2217(95)00137-9zbMath0912.90125OpenAlexW2162499224WikidataQ127343014 ScholiaQ127343014MaRDI QIDQ1268228

Narcís Nabona, Jordi Castro

Publication date: 25 May 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00137-9

zbMATH Keywords

multicommodity network flowadditional linear side constraintsprimal-dual interior point code

Mathematics Subject Classification ID

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

Related Items (13)

Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ A linear model for compound multicommodity network flow problems ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks ⋮ A nonlinear optimization package for long-term hydrothermal coordination. ⋮ Unnamed Item ⋮ The minimum shift design problem ⋮ From the physics of interacting polymers to optimizing routes on the London Underground ⋮ An efficient method for nonlinearly constrained networks ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ A novel modeling approach for express package carrier planning ⋮ Implementation and test of auction methods for solving generalized network flow problems with separable convex cost ⋮ On the first-order estimation of multipliers from Kuhn-Tucker systems

Uses Software

• PPRN
• MINOS
• DIMACS

Cites Work

• On large scale nonlinear network optimization
• Symmetric indefinite systems for interior point methods
• Development and computational tests of an undecoupled optimum short-term hydro-thermal scheduling code using network flows
• Truncated-Newton algorithms for large-scale unconstrained optimization
• An efficient implementation of the network simplex method
• Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Large-scale linearly constrained optimization
• Reinversion with the preassigned pivot procedure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An implementation of linear and nonlinear multicommodity network flows