From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
From MaRDI portal
Publication:1777422
DOI10.1007/s10878-004-4838-6zbMath1079.90085OpenAlexW2058989416MaRDI QIDQ1777422
Publication date: 13 May 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-004-4838-6
semidefinite programmingquadratic assignment problem\(K\)-CLUSTER problemconstrained-memory allocation problem
Related Items (21)
Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix ⋮ Taking advantage of symmetry in some quadratic assignment problems ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ A survey for the quadratic assignment problem ⋮ Generating cutting planes for the semidefinite relaxation of quadratic programs ⋮ Partial Lagrangian relaxation for general quadratic programming ⋮ Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster ⋮ On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods ⋮ Solving \(k\)-cluster problems to optimality with semidefinite programming ⋮ A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Exact solution of emerging quadratic assignment problems ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ An algorithm for the generalized quadratic assignment problem ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ An evaluation of semidefinite programming based approaches for discrete lot-sizing problems ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ Mathematical optimization ideas for biodiversity conservation
Uses Software
This page was built for publication: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
