A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
From MaRDI portal
Publication:5216778
DOI10.1137/18M1169710zbMath1434.90096arXiv1801.09155OpenAlexW3006858192WikidataQ122112915 ScholiaQ122112915MaRDI QIDQ5216778
Tunçel, Levent, Marcel Kenji De Carli Silva
Publication date: 20 February 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.09155
Semidefinite programming (90C22) Convex programming (90C25) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An axiomatic duality framework for the theta body and related convex corners
- Total dual integrality and integer polyhedra
- Geometric algorithms and combinatorial optimization.
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On product of association schemes and Shannon capacity
- On the Chvátal-Gomory closure of a compact convex set
- The split closure of a strictly convex body
- On the copositive representation of binary and continuous nonconvex quadratic programs
- An Abstract Linear Duality Model
- Gap, cosum and product properties of the θ′ bound on the clique number
- Weyl-minkowski duality for integarl monoids*
- Approximate graph coloring by semidefinite programming
- On Cutting Planes
- A comparison of the Delsarte and Lovász bounds
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the existence of optimal solutions to integer and mixed-integer programming problems
- A generalization of max flow—min cut
- Category of sequences of zeros and ones in some FK spaces
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Circular chromatic number: A survey
This page was built for publication: A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
