Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
From MaRDI portal
Publication:6176403
DOI10.1007/s10878-023-01065-yMaRDI QIDQ6176403
No author found.
Publication date: 22 August 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
- A robust optimization approach for multicast network coding under uncertain link costs
- Robust linear optimization under general norms.
- A new polynomial-time algorithm for linear programming
- Network error correction. I: Basic concepts and upper bounds
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust supply chain network design: an optimization model with real world application
- Recent advances in robust optimization: an overview
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Robust Convex Optimization
- Secure Cloud Storage Meets with Secure Network Coding
- Introduction to Stochastic Programming
- Theory and Applications of Robust Optimization
- Polynomial Time Algorithms for Multicast Network Code Construction
- Minimum-Cost Multicast over Coded Packet Networks
- A Random Linear Network Coding Approach to Multicast
- Resilient Network Coding in the Presence of Byzantine Adversaries
- The Price of Robustness
- Robust Solutions to Uncertain Semidefinite Programs
- Network information flow
- Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets
- Linear Network Coding Over Rings – Part II: Vector Codes and Non-Commutative Alphabets
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- Linear network coding
- Local-Encoding-Preserving Secure Network Coding
- Algebraic Algorithms for Vector Network Coding
- Universal Secure Network Coding via Rank-Metric Codes
- Robust capacity expansion of network flows
- Convergence Study of Decentralized Min-Cost Subgraph Algorithms for Multicast in Coded Networks
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Steiner tree problems
