Mixed linear and semidefinite programming for combinatorial and quadratic optimization
From MaRDI portal
Recommendations
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Semidefinite programming and combinatorial optimization
- Semidefinite programming and integer programming
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Semidefinite approximation for mixed binary quadratically constrained quadratic programs
Cites work
- scientific article; zbMATH DE number 45971 (Why is no real title available?)
- scientific article; zbMATH DE number 1302192 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1489802 (Why is no real title available?)
- A Spectral Bundle Method for Semidefinite Programming
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Improved approximation algorithms for MAX k-CUT and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite Programming
- Solving Graph Bisection Problems with Semidefinite Programming
- The quasi-isometry classification of lattices in semisimple Lie groups
Cited in
(18)- Positive semidefinite relaxations for distance geometry problems.
- A framework for solving mixed-integer semidefinite programs
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- LFTB: an efficient algorithm to bound linear fractional transformations
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Mixed settings for linear problems
- Randomized heuristics for the Max-Cut problem
- Metaheuristic algorithms
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- A discrete dynamic convexized method for the max-cut problem
- Semidefinite and Lagrangian relaxations for hard combinatorial problems
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Algorithm 1055: HDSDP: software for semidefinite programming
This page was built for publication: Mixed linear and semidefinite programming for combinatorial and quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504791)
