FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION

DOI10.1142/S0219265907001898MaRDI QIDQ3636562zbMATH OpenOpenAlexFDO

Authors Jérôme Galtier, A. 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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• Mathematical models of the delay constrained routing problem
• Fast data transmission and maximal dynamic flow.
• A Study of General Dynamic Network Programs with Arc Time-Delays
• Transmissions in a network with capacities and delays
• Single path routing with delay considerations

Cites work

• A new proximal decomposition algorithm for routing in telecommunication networks
• A survey of algorithms for convex multicommodity flow problems
• An algorithm for the resource constrained shortest path problem
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• On the Slater condition for the SDP relaxations of nonconvex sets
• Strong Duality for Semidefinite Programming
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(1)

• Mathematical models of the delay constrained routing problem

This page was built for publication: FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636562)