FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
From MaRDI portal
Publication:3636562
DOI10.1142/S0219265907001898zbMath1170.90332OpenAlexW2154445416MaRDI QIDQ3636562
Jérôme Galtier, Alexandre Laugier
Publication date: 30 June 2009
Published in: Journal of Interconnection Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219265907001898
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- The ellipsoid method and its consequences in combinatorial optimization
- On the Slater condition for the SDP relaxations of nonconvex sets
- Lectures on Modern Convex Optimization
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- An algorithm for the resource constrained shortest path problem
- Strong Duality for Semidefinite Programming
- A new proximal decomposition algorithm for routing in telecommunication networks
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
This page was built for publication: FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
