Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
From MaRDI portal
Publication:5864695
DOI10.1137/21M1413298zbMath1493.90131arXiv2104.08264MaRDI QIDQ5864695
Publication date: 8 June 2022
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.08264
convexity; multivariate polynomial; symmetry reduction; complete graph; redundancy scheduling; power-of-two model
90C35: Programming involving graphs or networks
26B25: Convexity of real functions of several variables, generalizations
05E18: Group actions on combinatorial structures
90C23: Polynomial optimization
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queueing with redundant requests: exact analysis
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- 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
- Deciding positivity of multisymmetric polynomials
- Symmetry in semidefinite programs
- Exploiting group symmetry in truss topology optimization
- Symmetry in Turán sums of squares polynomials from flag algebras
- Symmetric sums of squares over \(k\)-subset hypercubes
- Semidefinite bounds for mixed binary/ternary codes
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Semidefinite programming bounds for Lee codes
- Semidefinite bounds for nonbinary codes based on quadruples
- Practical graph isomorphism. II.
- Symmetric non-negative forms and sums of squares
- Invariant Semidefinite Programs
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- A comparison of the Delsarte and Lovász bounds
- Semidefinite Programming Bounds for Constant-Weight Codes
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Semidefinite Code Bounds Based on Quadruple Distances
- Flag algebras
