Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
From MaRDI portal
Publication:5152478
DOI10.1137/20M1369592zbMath1477.90056arXiv2009.04510OpenAlexW3164941252MaRDI QIDQ5152478
Andries Steenkamp, Daniel Brosch, Monique Laurent
Publication date: 24 September 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.04510
Nonconvex programming, global optimization (90C26) Queues and service in operations research (90B22) Polynomial optimization (90C23)
Related Items
Power-of-two sampling in redundancy systems: the impact of assignment constraints, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queueing with redundant requests: exact analysis
- On the degree and half-degree principle for symmetric polynomials
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Strengthened semidefinite programming bounds for codes
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- A non-commutative spectral theorem
- Symmetry in Turán sums of squares polynomials from flag algebras
- Symmetric sums of squares over \(k\)-subset hypercubes
- Symmetry groups, semidefinite programs, and sums of squares
- Semidefinite bounds for nonbinary codes based on quadruples
- Invariant Semidefinite Programs
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- A comparison of the Delsarte and Lovász bounds
- Association schemes and coding theory
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Semidefinite Code Bounds Based on Quadruple Distances
- Flag algebras
