SDP relaxations for some combinatorial optimization problems
From MaRDI portal
Publication:2802546
Recommendations
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On semidefinite programming relaxations of maximum \(k\)-section
- Relaxations of combinatorial problems via association schemes
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 995811 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 1342125 (Why is no real title available?)
- scientific article; zbMATH DE number 1182569 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- A comparison of the Delsarte and Lovász bounds
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A projection technique for partitioning the nodes of a graph
- A spectral approach to bandwidth and separator problems in graphs
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An Efficient Heuristic Procedure for Partitioning Graphs
- Assignment Problems
- Bounds for the quadratic assignment problem using the bundle method
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Graph partitioning and parallel computing
- Graph partitioning using linear and semidefinite programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Hospital Layout as a Quadratic Assignment Problem
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interlacing eigenvalues and graphs
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- Lower Bounds for the Partitioning of Graphs
- Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems
- On Lagrangian relaxation of quadratic matrix constraints
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On equivalence of semidefinite relaxations for quadratic matrix programming
- On semidefinite programming relaxations of maximum \(k\)-section
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Optimal Assignments of Numbers to Vertices
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- QAPLIB - a quadratic assignment problem library
- Recent advances in the solution of quadratic assignment problems
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Solving large quadratic assignment problems on computational grids
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Some simplified NP-complete graph problems
- The Backboard Wiring Problem: A Placement Algorithm
- The NP-completeness of the bandwidth minimization problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The bandwidth problem for graphs and matrices—a survey
- The quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
Cited in
(24)- SDP-based bounds for graph partition via extended ADMM
- Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
- Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
- Semidefinite programming for discrete optimization and matrix completion problems
- Combinatorial optimization problems in engineering applications
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Relaxations of combinatorial problems via association schemes
- Graph bisection revisited
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- The Maximum k-Colorable Subgraph Problem and Related Problems
- A framework for solving mixed-integer semidefinite programs
- Certifiably optimal sparse inverse covariance estimation
- On conic QPCCs, conic QCQPs and completely positive programs
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Semidefinite and Lagrangian relaxations for hard combinatorial problems
- An efficient semidefinite programming relaxation for the graph partition problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Matrix relaxations in combinatorial optimization
- On semidefinite programming bounds for graph bandwidth
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Partitioning through projections: strong SDP bounds for large graph partition problems
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
This page was built for publication: SDP relaxations for some combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802546)
