Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
DOI10.1287/moor.1050.0166zbMath1278.90061OpenAlexW2103843819MaRDI QIDQ5387955
Jay Sethuraman, Lisa K. Fleischer
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d8e1d0001b0f8e383c4ea876bae93159272deac7
optimal controlapproximation schememulticommodity flowmulticlass queueing networkscontinuous linear programs
Linear programming (90C05) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items (21)
This page was built for publication: Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions