On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems

Bibliographic Details
Main Authors:	de Klerk, E, Pasechnik, D
Format:	Record
Published:	CentER Discussion Paper‚ 2009−54 2009

Similar Items

On semidefinite programming relaxations of the traveling salesman problem
by: Klerk, E, et al.
Published: (2009)

On semidefinite programming relaxations of the traveling salesman problem
by: Klerk, E, et al.
Published: (2008)

Relaxations of combinatorial problems via association schemes
by: Klerk, E, et al.
Published: (2012)

Relaxations of combinatorial problems via association schemes
by: de Klerk, E, et al.
Published: (2011)

On semidefinite programming relaxations of maximum k-section
by: De Klerk, E, et al.
Published: (2012)

On semidefinite programming relaxations of maximum k−section
by: de Klerk, E, et al.
Published: (2012)

Numerical block diagonalization of matrix *−algebras with application to semidefinite programming
by: de Klerk, E, et al.
Published: (2011)

Reduction of symmetric semidefinite programs using the regular *−representation
by: de Klerk, E, et al.
Published: (2007)

Numerical block diagonalization of matrix - algebras with application to semidefinite programming
by: Klerk, Etienne de., et al.
Published: (2012)

Reduction of symmetric semidefinite programs using the regular representation
by: Klerk, Etienne de., et al.
Published: (2012)

Improved lower bounds for the 2−page crossing numbers of Km‚n and Kn via semidefinite programming
by: de Klerk, E, et al.
Published: (2012)

Improved lower bounds for the 2-page crossing numbers of Km,n and Kn via semidefinite programming
by: Klerk, E. de., et al.
Published: (2013)

On the local stability of semidefinite relaxations
by: Cifuentes, Diego, et al.
Published: (2022)

Large-scale binary quadratic optimization using semidefinite relaxation and applications
by: Wang, P, et al.
Published: (2016)

Discrete-continuous optimization for robot perception via semidefinite relaxation
by: Hu, Siyi,S.M.Massachusetts Institute of Technology.
Published: (2019)

A paradox in bosonic energy computations via semidefinite programming relaxations
by: M Navascués, et al.
Published: (2013-01-01)

Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming
by: Hu, Sha, S.M. Massachusetts Institute of Technology
Published: (2007)

Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts
by: Sherali, Hanif D., et al.
Published: (2013)

A linear programming reformulation of the standard quadratic optimization problem
by: de Klerk, E, et al.
Published: (2007)

Doubly Nonnegative and Semidefinite Relaxations for the Densest <i>k</i>-Subgraph Problem
by: Chuan-Hao Guo, et al.
Published: (2019-01-01)

Polynomial Structure in Semidefinite Relaxations and Non-Convex Formulations
by: Yuan, Chenyang
Published: (2023)

ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
by: Igor Klep, et al.
Published: (2012-12-01)

Subsampling algorithms for semidefinite programming
by: Alexandre W. d'Aspremont
Published: (2011-01-01)

Semidefinite programming and linear equations vs. homomorphism problems
by: Ciardo, L, et al.
Published: (2024)

Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
by: Saunderson, James F, et al.
Published: (2017)

An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
by: Yang, Heng, et al.
Published: (2023)

A linear programming reformulation of the standard quadratic optimization problem
by: Klerk, Etienne de., et al.
Published: (2013)

Applications of Semidefinite Optimization in Stochastic Project Scheduling
by: Bertsimas, Dimitris J., et al.
Published: (2003)

Optimal networks for quantum metrology: semidefinite programs and product rules
by: Giulio Chiribella
Published: (2012-01-01)

On polyhedral and second-order cone decompositions of semidefinite optimization problems
by: Bertsimas, Dimitris J, et al.
Published: (2021)

Efficient semidefinite programming with approximate ADMM
by: Rontsis, N, et al.
Published: (2021)

Inference on graphs via semidefinite programming
by: Sousa Bandeira, Afonso Jose
Published: (2017)

Data for "Optimality of spherical codes via exact semidefinite programming bounds"
by: Cohn, Henry, et al.
Published: (2024)

Optimal Power Flow for radial and mesh grids using semidefinite programming
by: Oscar D. Montoya-Giraldo, et al.
Published: (2017-09-01)

Semidefinite Multiobjective Mathematical Programming Problems with Vanishing Constraints Using Convexificators
by: Kin Keung Lai, et al.
Published: (2021-12-01)

TDOA-Based Source Collaborative Localization via Semidefinite Relaxation in Sensor Networks
by: Yongsheng Yan, et al.
Published: (2015-09-01)

Semidefinite Relaxation Method for Target Localization by MIMO Radar Using Bistatic Ranges
by: Bin Sun, et al.
Published: (2014-08-01)

Scheduling multiclass queueing networks and job shops using fluid and semidefinite relaxations
by: Sethuraman, Jayachandran, 1970-
Published: (2005)

Constant modulus shaped beam synthesis via linear fractional semidefinite relaxation
by: Xiuquan Dou, et al.
Published: (2022-09-01)

TDOA-Based Source Collaborative Localization via Semidefinite Relaxation in Sensor Networks
by: Yan, Yongsheng, et al.
Published: (2015)