On a parametric shortest path problem from primal—dual multicommodity network optimization

DOI10.1002/net.3230220306zbMath0770.90045OpenAlexW2168230055MaRDI QIDQ3993634

George G. Polak

Publication date: 23 July 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220306

zbMATH Keywords

maximal multicommodity flowmulticommodity network synthesisprimal-dual linear programming algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Unnamed Item ⋮ A parametric critical path problem and an application for cyclic scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a parametric shortest path problem from primal—dual multicommodity network optimization