Improved Semidefinite Programming Bounds for Quadratic Assignment Problems With Suitable Symmetry

Mathematical Programming, Series B- Germany

doi 10.1007/s10107-010-0411-5

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005French

Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

2019English

Complex Quadratic Optimization and Semidefinite Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2006English

Generalized Chebyshev Bounds via Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2007English

Semidefinite Programming and Multivariate Chebyshev Bounds

IFAC Proceedings Volumes
2006English

Sdpt3r: Semidefinite Quadratic Linear Programming in R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2019Italian

New Upper Bounds for Kissing Numbers From Semidefinite Programming

Journal of the American Mathematical Society
MathematicsApplied Mathematics
2008English

Multiobjective Duality for Convex Semidefinite Programming Problems

Zeitschrift fur Analysis und ihre Anwendung
Applied MathematicsAnalysis
2003English

Bounds for the Quadratic Assignment Problem Using the Bundle Method

Mathematical Programming, Series B
MathematicsSoftware
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy