On the public citation graph
Nonpolyhedral Relaxations of Graph-Bisection Problems
0 signed · 91 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.1006/eujc.1993.1035openalex-snapshot
Combinatorial Properties and the Complexity of a Max-cut Approximation
inferredcites →https://doi.org/10.1006/eujc.1996.0020openalex-snapshot
Gap Inequalities for the Cut Polytope
inferredcites →https://doi.org/10.1007/bf01303512openalex-snapshot
The hypermetric cone is polyhedral
inferredcites →https://doi.org/10.1007/bf01581147openalex-snapshot
A computational study of graph partitioning
inferredcites →https://doi.org/10.1007/bf01585184openalex-snapshot
Laplacian eigenvalues and the maximum cut problem
inferredcites →https://doi.org/10.1007/bf02032130openalex-snapshot
A projection technique for partitioning the nodes of a graph
inferredcites →https://doi.org/10.1016/0024-3795(81)90143-9openalex-snapshot
Some applications of optimization in matrix theory
inferredcites →https://doi.org/10.1016/0166-218x(94)00155-7openalex-snapshot
Solving the max-cut problem using eigenvalues
inferredcites →https://doi.org/10.1016/0167-6377(83)90016-0openalex-snapshot
The max-cut problem on graphs not contractible to K5
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.1137/0609021openalex-snapshot
On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
inferredcites →https://doi.org/10.1137/0802007openalex-snapshot
Large-Scale Optimization of Eigenvalues
inferredcites →https://doi.org/10.1137/0802008openalex-snapshot
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
inferredcites →https://doi.org/10.1147/rd.175.0420openalex-snapshot
Lower Bounds for the Partitioning of Graphs
inferredcites →https://doi.org/10.1287/opre.36.3.493openalex-snapshot
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20220openalex-snapshot
Spectral bounds for the maximum cut problem
inferred← citeshttps://doi.org/10.1002/rsa.20096openalex-snapshot
MAXk‐CUT and approximating the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1006/jcss.2001.1773openalex-snapshot
Heuristics for Semirandom Graph Problems
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1381openalex-snapshot
Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut
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-45061-0_18openalex-snapshot
MAX k-CUT and Approximating the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45783-6_18openalex-snapshot
Unsupervised Image Partitioning with Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-0571-5_5openalex-snapshot
FIR Filter Design via Spectral Factorization and Convex Optimization
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-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_4openalex-snapshot
The Boolean Quadric Polytope
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_6openalex-snapshot
Mathematical Programming Models and Exact Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-03488-5_17openalex-snapshot
A Computational Study on Supervised and Unsupervised Gait Data Segmentation
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_8openalex-snapshot
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_23openalex-snapshot
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_17openalex-snapshot
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-58891-4_11openalex-snapshot
Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_6openalex-snapshot
Some applications of Laplace eigenvalues of graphs
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/bf02238072openalex-snapshot
Node and edge relaxations of the Max-cut problem
inferred← citeshttps://doi.org/10.1007/bf02614315openalex-snapshot
Semidefinite programming in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02614436openalex-snapshot
Connections between semidefinite relaxations of the max-cut and stable set problems
inferred← citeshttps://doi.org/10.1007/s10107-002-0352-8openalex-snapshot
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
inferred← citeshttps://doi.org/10.1007/s10107-005-0661-9openalex-snapshot
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition
inferred← citeshttps://doi.org/10.1007/s10107-008-0235-8openalex-snapshot
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
inferred← citeshttps://doi.org/10.1007/s10107-012-0603-2openalex-snapshot
On semidefinite programming relaxations of maximum $$k$$ -section
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/s12532-012-0040-5openalex-snapshot
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
inferred← citeshttps://doi.org/10.1007/s12532-025-00275-1openalex-snapshot
Instance-specific linear relaxations of semidefinite optimization problems
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00271-ropenalex-snapshot
On a positive semidefinite relaxation of the cut polytope
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/0166-218x(94)00155-7openalex-snapshot
Solving the max-cut problem using eigenvalues
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90020-5openalex-snapshot
Applications of cut polyhedra — I
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90021-3openalex-snapshot
Applications of cut polyhedra — II
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.02.042openalex-snapshot
Spectral bounds for unconstrained (−1,1)-quadratic optimization problems
inferred← citeshttps://doi.org/10.1016/j.laa.2015.09.043openalex-snapshot
New bounds for the max-k-cut and chromatic number of a graph
inferred← citeshttps://doi.org/10.1016/j.orl.2011.07.002openalex-snapshot
Gap inequalities for non-convex mixed-integer quadratic programs
inferred← citeshttps://doi.org/10.1016/j.sigpro.2009.04.025openalex-snapshot
Using the eigenvalue relaxation for binary least-squares estimation problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00358-5openalex-snapshot
Cardinality constrained minimum cut problems: complexity and algorithms
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00097-xopenalex-snapshot
Semidefinite programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00021-5openalex-snapshot
Spectral methods for graph bisection problems
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferred← citeshttps://doi.org/10.1023/a:1011416130639openalex-snapshot
Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1023/a:1020351410169openalex-snapshot
Generating Convex Polynomial Inequalities for Mixed 0–1 Programs
inferred← citeshttps://doi.org/10.1051/ro/2018034openalex-snapshot
A guide to conic optimisation and its applications
inferred← citeshttps://doi.org/10.1080/03081089508818377openalex-snapshot
A survey of graph laplacians
inferred← citeshttps://doi.org/10.1080/10556788.2016.1270279openalex-snapshot
The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
inferred← citeshttps://doi.org/10.1090/fic/018/14openalex-snapshot
Cutting plane algorithms for semidefinite relaxations
inferred← citeshttps://doi.org/10.1109/acssc.2011.6190145openalex-snapshot
Incorporating prior information into semidefinite relaxation of quadratic optimization problems
inferred← citeshttps://doi.org/10.1109/camsap.2011.6135910openalex-snapshot
An interior point method for a semidefinite relaxation based equalizer incorporating prior information
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743518openalex-snapshot
Heuristics for finding large independent sets, with applications to coloring semi-random graphs
inferred← citeshttps://doi.org/10.1109/tpami.2003.1240111openalex-snapshot
Binary partitioning, perceptual grouping, and restoration with semidefinite programming
inferred← citeshttps://doi.org/10.1109/tsp.2025.3604409openalex-snapshot
Relaxation-Free Min-$k$-Partition for PCI Assignment in 5G Networks
inferred← citeshttps://doi.org/10.1137/0806020openalex-snapshot
An Interior-Point Method for Semidefinite Programming
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/19m1255318openalex-snapshot
Rank Optimality for the Burer--Monteiro Factorization
inferred← citeshttps://doi.org/10.1137/s089547989631442xopenalex-snapshot
Fixing Variables in Semidefinite Relaxations
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/s1052623400382467openalex-snapshot
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
inferred← citeshttps://doi.org/10.1137/s1052623497328987openalex-snapshot
A Spectral Bundle Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1145/1374376.1374425openalex-snapshot
An optimal sdp algorithm for max-cut, and equally optimal long code tests
inferred← citeshttps://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferred← citeshttps://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferred← citeshttps://doi.org/10.1145/3549554openalex-snapshot
Bridging Classical and Quantum with SDP initialized warm-starts for QAOA
inferred← citeshttps://doi.org/10.1287/ijoc.12.3.177.12637openalex-snapshot
Solving Graph Bisection Problems with Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/moor.20.3.550openalex-snapshot
Convex Relaxations of (0, 1)-Quadratic Programming
inferred← citeshttps://doi.org/10.1504/ijmor.2012.046688openalex-snapshot
A gradient-based randomised heuristic for the maximum cut problem
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.97openalex-snapshot
The SDP Value of Random 2CSPs
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.