Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks

DOI10.1007/s10951-013-0333-1zbMath1305.90210OpenAlexW2092827795MaRDI QIDQ490355

Abdel Lisser, Pablo Adasme

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0333-1

zbMATH Keywords

stochastic programmingquadratic programmingsemidefinite programmingresource allocation in OFDMA

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)

Related Items

Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations

Uses Software

• CSDP

Cites Work

• Unnamed Item
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Knapsack problem with probability constraints
• Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
• On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
• Geometric algorithms and combinatorial optimization
• Stochastic integer programming: general models and algorithms
• A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
• A semidefinite programming approach to the quadratic knapsack problem
• A primal-dual decomposition algorithm for multistage stochastic convex programming
• Stochastic Quadratic Knapsack with Recourse
• On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
• Lectures on Stochastic Programming
• Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
• Introduction to Stochastic Programming
• Two‐stage stochastic integer programming: a survey
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• CSDP, A C library for semidefinite programming
• A Spectral Bundle Method for Semidefinite Programming
• Variable neighborhood search: Principles and applications