Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations

DOI10.1007/978-1-4614-3924-0_2zbMath1327.90037OpenAlexW141481420MaRDI QIDQ3454971

Minghua Chen, Mung Chiang

Publication date: 3 December 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-3924-0_2

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Fractional programming (90C32) Linear programming (90C05)

Related Items (1)

Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation

Cites Work

• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• Selected topics in robust convex optimization
• Robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• The Price of Robustness
• Robust Solutions to Uncertain Semidefinite Programs
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Peer-to-Peer Streaming Capacity
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations