On the public citation graph

Node and edge relaxations of the Max-cut problem

https://doi.org/10.1007/bf02238072
0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-322-92106-2openalex-snapshot
Combinatorial Algorithms for Integrated Circuit Layout
inferredcites →https://doi.org/10.1007/bf01585184openalex-snapshot
Laplacian eigenvalues and the maximum cut problem
inferredcites →https://doi.org/10.1007/bf01587084openalex-snapshot
Experiments in quadratic 0–1 programming
inferredcites →https://doi.org/10.1007/bf02247879openalex-snapshot
Computational aspects of a branch and bound algorithm for quadratic zero-one programming
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.1080/07481188908252281openalex-snapshot
Personal communication
inferredcites →https://doi.org/10.1080/10556789408805564openalex-snapshot
A cutting plane algorithm for the max-cut problem
inferredcites →https://doi.org/10.1137/0204019openalex-snapshot
Finding a Maximum Cut of a Planar Graph in Polynomial Time
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.1137/0805024openalex-snapshot
Nonpolyhedral Relaxations of Graph-Bisection Problems
inferredcites →https://doi.org/10.1287/opre.36.3.493openalex-snapshot
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
inferredcites →https://doi.org/10.1515/9783112479926-022openalex-snapshot
A COMBINATION OP THE BUNDLE APPROACH AND THE TRUST REGION CONCEPT
inferredcites →https://doi.org/10.21136/cmj.1990.102386openalex-snapshot
Eigenvalues and the max-cut 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/978-0-387-30162-4_219openalex-snapshot
Max Cut
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_2openalex-snapshot
Maximization of Submodular Functions: Theory and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_3openalex-snapshot
Data Correcting Approach for the Maximization of Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_4openalex-snapshot
Data Correcting Approach for the Simple Plant Location Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_5openalex-snapshot
Summary
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_219openalex-snapshot
Max Cut
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_219-2openalex-snapshot
Max Cut
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/bf02614430openalex-snapshot
In memory of Svatopluk Poljak
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/0166-218x(94)00155-7openalex-snapshot
Solving the max-cut problem using eigenvalues
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90068-xopenalex-snapshot
The expected relative error of the polyhedral approximation of 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.1109/icnn.1997.616215openalex-snapshot
An evolutionary neural network algorithm for max cut problems
inferred← citeshttps://doi.org/10.1137/s1052623497328987openalex-snapshot
A Spectral Bundle Method for Semidefinite Programming
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.1287/moor.20.3.550openalex-snapshot
Convex Relaxations of (0, 1)-Quadratic Programming
inferred← citeshttps://doi.org/10.1360/02yf9001openalex-snapshot
Neural networks and graph theory
inferred← citeshttps://doi.org/10.24963/ijcai.2019/157openalex-snapshot
Entropy-Penalized Semidefinite Programming
inferred← citeshttps://doi.org/10.6100/ir553708openalex-snapshot
Combinatorial approximation algorithms : guaranteed versus experimental performance
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.