Nonlinear programming in telecommunications

MaRDI QIDQ5294041zbMATH OpenFDO

Authors Athanasios Migdalas

Publication date 23 July 2007

zbMATH Keywords

nonlinear optimizationbilevel programmingNash equilibriumnetwork designroutingStackelberg gamesimplicial decompositionteam gamescapacity assignmentWardrop's principleequilibrium flowsFrank-Wolfe-like algorithms

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)

Recommendations

• Foundations of network optimization and games
• Equilibrium, games, and pricing in transportation and telecommunication networks
• A survey on networking games in telecommunications
• A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
• scientific article; zbMATH DE number 5173825

Cited in

(5)

• scientific article; zbMATH DE number 5070513 (Why is no real title available?)
• A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
• Foundations of network optimization and games
• Network planning problems in telecommunications
• Relational optimization and its application: from bottleneck flow control to wireless channel allocation

This page was built for publication: Nonlinear programming in telecommunications

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