The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization

Semidefinite programming (90C22) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Lower bounding procedure for the asymmetric quadratic traveling salesman problem
Global optimization of robust truss topology via mixed integer semidefinite programming
Total dual integrality and integer polyhedra
Binary positive semidefinite matrices and associated integer polytopes
A class of exponential neighbourhoods for the quadratic travelling salesman problem
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
Conic mixed-integer rounding cuts
Optimizing over the first Chvátal closure
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
Cones of diagonally dominant matrices
Some geometric results in semidefinite programming
A new branch and bound method for a discrete truss topology design problem
A branch-and-cut method for 0-1 mixed convex programming
Geometric and LP-based heuristics for angular travelling salesman problems in the plane
On a generalization of the Chvátal-Gomory closure
On the tightness of SDP relaxations of QCQPs
The quadratic cycle cover problem: special cases and efficient bounds
On the Chvátal-Gomory closure of a compact convex set
On the rational polytopes with Chvátal rank 1
Covering tours and cycle covers with turn costs: hardness and approximation
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
The symmetric quadratic traveling salesman problem
Kernels of directed graph Laplacians
Edmonds polytopes and a hierarchy of combinatorial problems
Cuts for mixed 0-1 conic programming
Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
The Chvátal-Gomory Closure of a Strictly Convex Body
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Deciding Polyhedrality of Spectrahedra
BiqCrunch
Outline of an algorithm for integer solutions to linear programs
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
On Cutting Planes
TSPLIB—A Traveling Salesman Problem Library
A framework for solving mixed-integer semidefinite programs
The Angular-Metric Traveling Salesman Problem
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
A Primer on Laplacian Dynamics in Directed Graphs
The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope
A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
Semidefinite programming duality and linear time-invariant systems
Minimization and maximization versions of the quadratic travelling salesman problem
Solution of a Large-Scale Traveling-Salesman Problem
Cuts for Conic Mixed-Integer Programming
Algebraic connectivity of directed graphs
Optimal Covering Tours with Turn Costs
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
JuMP: A Modeling Language for Mathematical Optimization
Reload cost problems: Minimum diameter spanning tree

This page was built for publication: The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665386)