On the public citation graph
Connections between semidefinite relaxations of the max-cut and stable set problems
0 signed · 62 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01580600openalex-snapshot
On cuts and matchings in planar graphs
inferredcites →https://doi.org/10.1007/bf01581273openalex-snapshot
A lift-and-project cutting plane algorithm for mixed 0–1 programs
inferredcites →https://doi.org/10.1007/bf01585184openalex-snapshot
Laplacian eigenvalues and the maximum cut problem
inferredcites →https://doi.org/10.1007/bf01589101openalex-snapshot
The boolean quadric polytope: Some characteristics, facets and relatives
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferredcites →https://doi.org/10.1016/0012-365x(90)90056-nopenalex-snapshot
The cut polytope and the Boolean quadric polytope
inferredcites →https://doi.org/10.1016/0024-3795(84)90207-6openalex-snapshot
Positive definite completions of partial Hermitian matrices
inferredcites →https://doi.org/10.1016/0024-3795(95)00271-ropenalex-snapshot
On a positive semidefinite relaxation of the cut polytope
inferredcites →https://doi.org/10.1016/0024-3795(95)00741-5openalex-snapshot
The real positive semidefinite completion problem for series-parallel graphs
inferredcites →https://doi.org/10.1016/0167-6377(94)90068-xopenalex-snapshot
The expected relative error of the polyhedral approximation of the max-cut problem
inferredcites →https://doi.org/10.1090/memo/0584openalex-snapshot
The real positive definite completion problem: cycle completability
inferredcites →https://doi.org/10.1109/istcs.1995.377033openalex-snapshot
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
inferredcites →https://doi.org/10.1109/tit.1979.1056072openalex-snapshot
A comparison of the Delsarte and Lovász bounds
inferredcites →https://doi.org/10.1137/0617031openalex-snapshot
On the Facial Structure of the Set of Correlation Matrices
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/0805024openalex-snapshot
Nonpolyhedral Relaxations of Graph-Bisection Problems
inferredcites →https://doi.org/10.1137/0806020openalex-snapshot
An Interior-Point Method for Semidefinite Programming
inferredcites →https://doi.org/10.1137/s0895480195287541openalex-snapshot
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
inferredcites →https://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferredcites →https://doi.org/10.1287/opre.13.3.388openalex-snapshot
Some Network Flow Problems Solved with Pseudo-Boolean Programming
inferredcites →https://doi.org/10.21236/ada298925openalex-snapshot
Polyhedral Methods for the Maximum Clique Problem,
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36478-1_9openalex-snapshot
The Bundle Method for Hard Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_46openalex-snapshot
Combining semidefinite and polyhedral relaxations for integer programs
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_20openalex-snapshot
Fixing variables in semidefinite relaxations
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_98openalex-snapshot
Solving and approximating combinatorial optimization problems (Towards MAX CUT and TSP)
inferred← citeshttps://doi.org/10.1007/978-1-4613-0279-7_25openalex-snapshot
Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0279-7_9openalex-snapshot
Lagrangian Quadratic Bounds in Polynomial Nonconvex and Boolean Models with Superfluous Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_22openalex-snapshot
Semidefinite Programming and Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_18openalex-snapshot
Semidefinite Relaxations for Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_9openalex-snapshot
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program
inferred← citeshttps://doi.org/10.1007/bf01580072openalex-snapshot
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
inferred← citeshttps://doi.org/10.1007/bf02614315openalex-snapshot
Semidefinite programming in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10107-002-0353-7openalex-snapshot
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
inferred← citeshttps://doi.org/10.1007/s10107-005-0604-5openalex-snapshot
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
inferred← citeshttps://doi.org/10.1007/s10107-008-0219-8openalex-snapshot
An application of the Lovász–Schrijver M(K, K) operator to the stable set problem
inferred← citeshttps://doi.org/10.1007/s10107-009-0275-8openalex-snapshot
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
inferred← citeshttps://doi.org/10.1007/s10107-025-02209-0openalex-snapshot
A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem
inferred← citeshttps://doi.org/10.1007/s101070100279openalex-snapshot
Solving a class of semidefinite programs via nonlinear programming
inferred← citeshttps://doi.org/10.1007/s10878-004-4838-6openalex-snapshot
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00741-5openalex-snapshot
The real positive semidefinite completion problem for series-parallel graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2005.01.011openalex-snapshot
Exploiting semidefinite relaxations in constraint programming
inferred← citeshttps://doi.org/10.1016/j.jmva.2005.08.008openalex-snapshot
Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models
inferred← citeshttps://doi.org/10.1016/j.orl.2007.10.006openalex-snapshot
The equivalence of semidefinite relaxations of polynomial 0–1 and ± 1 programs via scaling
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00266-9openalex-snapshot
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00097-xopenalex-snapshot
Semidefinite programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferred← citeshttps://doi.org/10.1023/a:1014004625997openalex-snapshot
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
inferred← citeshttps://doi.org/10.1023/a:1027364420370openalex-snapshot
A Tight Semidefinite Relaxation of the MAX CUT Problem
inferred← citeshttps://doi.org/10.1051/ro:2003012openalex-snapshot
A Derivation of Lovász' Theta via Augmented Lagrange Duality
inferred← citeshttps://doi.org/10.1080/01621459.2015.1100621openalex-snapshot
Modeling Probability Forecasts via Information Diversity
inferred← citeshttps://doi.org/10.1090/fic/018/14openalex-snapshot
Cutting plane algorithms for semidefinite relaxations
inferred← citeshttps://doi.org/10.1137/1.9780898718805.ch15openalex-snapshot
15. A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations
inferred← citeshttps://doi.org/10.1137/130945818openalex-snapshot
Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives
inferred← citeshttps://doi.org/10.1137/23m1580905openalex-snapshot
On Integrality in Semidefinite Programming for Discrete Optimization
inferred← citeshttps://doi.org/10.1137/s1052623400379371openalex-snapshot
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure
inferred← citeshttps://doi.org/10.1137/s1052623401394092openalex-snapshot
Computational Experience with Stable Set Relaxations
inferred← citeshttps://doi.org/10.1137/s105262340240851xopenalex-snapshot
Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
inferred← citeshttps://doi.org/10.1137/s1052623497328987openalex-snapshot
A Spectral Bundle Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1142/s0217595914500225openalex-snapshot
SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.