Mathematical aspects of network routing optimization.
DOI10.1007/978-1-4614-0311-1zbMath1225.90002OpenAlexW590063558MaRDI QIDQ549117
Carlos A. S. Oliveira, Panos M. Pardalos
Publication date: 7 July 2011
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0311-1
integer programmingmetaheuristicsnetworksapproximation algorithmsdistributed algorithmsSteiner treesmulticast routingonline routingcache placement problemminimum cost routingpoint-to-point connection problemunicast routingwireless ad hoc systems
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (9)
This page was built for publication: Mathematical aspects of network routing optimization.