A Lagrangian approach to chance constrained routing with local broadcast

DOI10.1007/978-3-030-63072-0_22zbMath1479.90053OpenAlexW3123783601MaRDI QIDQ2056917

Laura Galli, Antonio Frangioni, Giovanni Stea, Matteo Cacciola

Publication date: 8 December 2021

Full work available at URL: http://hdl.handle.net/11568/1037524

zbMATH Keywords

Lagrangian relaxationbranch-and-boundmixed integer nonlinear programmingbundle methodschance-constrained optimizationlocal broadcastInternet-of-thingsmobile network routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Communication networks in operations research (90B18) Linear programming (90C05) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)

Cites Work

• About Lagrangian methods in integer optimization
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
• New approaches for optimizing over the semimetric polytope
• Generalized Bundle Methods

This page was built for publication: A Lagrangian approach to chance constrained routing with local broadcast