On the public citation graph
Semidefinite programming in combinatorial optimization
0 signed · 232 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.1007/3-540-60313-1_146openalex-snapshot
A geometric approach to betweenness
inferredcites →https://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-642-04295-9openalex-snapshot
Geometry of Cuts and Metrics
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-662-39641-4_2openalex-snapshot
The Bounds of Delsarte and Lovász, and Their Applications to Coding Theory
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/bf01581168openalex-snapshot
Approximating the independence number via theϑ-function
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/bf02523688openalex-snapshot
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
inferredcites →https://doi.org/10.1007/bf02574037openalex-snapshot
Problems of distance geometry and convex properties of quadratic maps
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02579314openalex-snapshot
The asymptotic behaviour of lovász’ ϑ function for random graphs
inferredcites →https://doi.org/10.1007/bf02614432openalex-snapshot
Complementarity and nondegeneracy in semidefinite programming
inferredcites →https://doi.org/10.1007/bf02614436openalex-snapshot
Connections between semidefinite relaxations of the max-cut and stable set problems
inferredcites →https://doi.org/10.1007/bf02776078openalex-snapshot
On lipschitz embedding of finite metric spaces in Hilbert space
inferredcites →https://doi.org/10.1016/0022-0000(91)90024-yopenalex-snapshot
Expressing combinatorial optimization problems by Linear Programs
inferredcites →https://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferredcites →https://doi.org/10.1016/0095-8956(86)90087-0openalex-snapshot
Relaxations of vertex packing
inferredcites →https://doi.org/10.1016/0166-218x(92)00190-wopenalex-snapshot
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problems
inferredcites →https://doi.org/10.1016/0885-064x(92)90003-topenalex-snapshot
A problem that is easier to solve on the unit-cost algebraic RAM
inferredcites →https://doi.org/10.1016/0890-5401(89)90067-9openalex-snapshot
Approximate counting, uniform generation and rapidly mixing Markov chains
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1090/dimacs/001/01openalex-snapshot
Matrix cones, projection representations, and stable set polyhedra
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/sfcs.1988.21958openalex-snapshot
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
inferredcites →https://doi.org/10.1109/sfcs.1994.365707openalex-snapshot
A note on the θ number of Lovasz and the generalized Delsarte bound
inferredcites →https://doi.org/10.1109/sfcs.1994.365710openalex-snapshot
Approximate graph coloring by semidefinite programming
inferredcites →https://doi.org/10.1109/sfcs.1995.492473openalex-snapshot
Derandomizing semidefinite programming based approximation algorithms
inferredcites →https://doi.org/10.1109/tit.1956.1056798openalex-snapshot
The zero error capacity of a noisy channel
inferredcites →https://doi.org/10.1109/tit.1977.1055688openalex-snapshot
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
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/0211045openalex-snapshot
Approximation Algorithms for the Set Covering and Vertex Cover Problems
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/0805024openalex-snapshot
Nonpolyhedral Relaxations of Graph-Bisection Problems
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s0097539794285983openalex-snapshot
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
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.1137/s0895480195296221openalex-snapshot
A Geometric Approach to Betweenness
inferredcites →https://doi.org/10.1145/225058.225281openalex-snapshot
Randomized graph products, chromatic numbers, and Lovasz j-function
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/237814.237990openalex-snapshot
How good is the Goemans-Williamson MAX CUT algorithm?
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/62212.62232openalex-snapshot
Expressing combinatorial optimization problems by linear programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118567869.ch18openalex-snapshot
Network Algorithms for Protein Interactions
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_2openalex-snapshot
Continuous Approaches for Solving Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/11362197_4openalex-snapshot
A New Theoretical Framework for K-Means-Type Clustering
inferred← citeshttps://doi.org/10.1007/11585978_21openalex-snapshot
Stable Bounded Canonical Sets and Image Matching
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-48777-8_10openalex-snapshot
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-35514-6_13openalex-snapshot
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-0158-3_18openalex-snapshot
Foundations of Set-Semidefinite Optimization
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-1927-3_17openalex-snapshot
Matrix Relaxations in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-5197-3_2openalex-snapshot
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-5223-9_19openalex-snapshot
Nonconvex Quadratic Programming, Semidefinite Relaxations and Randomization Algorithms in Information and Decision Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_28openalex-snapshot
Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-16489-8_7openalex-snapshot
Lipschitz Isomorphisms of Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_292-1openalex-snapshot
Interior Point Methods for Semidefinite 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-540-68891-4_9openalex-snapshot
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_2openalex-snapshot
Cuts for Conic Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72823-8_32openalex-snapshot
Combining Different Types of Scale Space Interest Points Using Canonical Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-36844-8_15openalex-snapshot
Application of Semidefinite Programming to Maximize the Spectral Gap Produced by Node Removal
inferred← citeshttps://doi.org/10.1007/978-3-642-56645-5_3openalex-snapshot
Cuts and Semidefinite Relaxations for Nonconvex Quadratic Problems
inferred← citeshttps://doi.org/10.1007/978-94-017-8041-4_30openalex-snapshot
A Perspective on Physics in Cuba
inferred← citeshttps://doi.org/10.1007/pl00011394openalex-snapshot
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
inferred← citeshttps://doi.org/10.1007/s00186-017-0579-zopenalex-snapshot
A space decomposition scheme for maximum eigenvalue functions and its applications
inferred← citeshttps://doi.org/10.1007/s00454-007-9007-0openalex-snapshot
Fréchet Embeddings of Negative Type Metrics
inferred← citeshttps://doi.org/10.1007/s006070050038openalex-snapshot
Semidefinite Programs and Association Schemes
inferred← citeshttps://doi.org/10.1007/s10100-018-0533-zopenalex-snapshot
Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
inferred← citeshttps://doi.org/10.1007/s10107-002-0354-6openalex-snapshot
Numerical evaluation of SBmethod
inferred← citeshttps://doi.org/10.1007/s10107-005-0578-3openalex-snapshot
Cuts for mixed 0-1 conic programming
inferred← citeshttps://doi.org/10.1007/s10107-008-0239-4openalex-snapshot
Conic mixed-integer rounding cuts
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-009-0330-5openalex-snapshot
Moment inequalities for sums of random matrices and their applications in optimization
inferred← citeshttps://doi.org/10.1007/s10107-010-0352-zopenalex-snapshot
Binary positive semidefinite matrices and associated integer polytopes
inferred← citeshttps://doi.org/10.1007/s10107-016-1041-3openalex-snapshot
An axiomatic duality framework for the theta body and related convex corners
inferred← citeshttps://doi.org/10.1007/s10107-023-01952-6openalex-snapshot
Solving graph equipartition SDPs on an algebraic variety
inferred← citeshttps://doi.org/10.1007/s10479-007-0169-1openalex-snapshot
The omnipresence of Lagrange
inferred← citeshttps://doi.org/10.1007/s10898-004-6536-4openalex-snapshot
Improving an Upper Bound on the Stability Number of a Graph
inferred← citeshttps://doi.org/10.1007/s10898-018-0617-2openalex-snapshot
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
inferred← citeshttps://doi.org/10.1007/s10915-025-02952-8openalex-snapshot
Solving Low-Rank Semidefinite Programs via Manifold Optimization
inferred← citeshttps://doi.org/10.1007/s10957-026-03048-5openalex-snapshot
On the Structure and Computation of Extremal Mediated Graphs with Applications to Conic Optimization
inferred← citeshttps://doi.org/10.1007/s11117-014-0292-6openalex-snapshot
Optimality conditions for nonsmooth semidefinite programming via convexificators
inferred← citeshttps://doi.org/10.1007/s11228-016-0365-8openalex-snapshot
A Fast Space-decomposition Scheme for Nonconvex Eigenvalue Optimization
inferred← citeshttps://doi.org/10.1007/s11425-007-0080-xopenalex-snapshot
Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
inferred← citeshttps://doi.org/10.1007/s11511-012-0071-9openalex-snapshot
Compression bounds for Lipschitz maps from the Heisenberg group to L1
inferred← citeshttps://doi.org/10.1007/s11766-002-0051-5openalex-snapshot
Semi-definite relaxation algorithm of multiple knapsack problem
inferred← citeshttps://doi.org/10.1007/s11856-014-1088-xopenalex-snapshot
Vertical versus horizontal Poincaré inequalities on the Heisenberg group
inferred← citeshttps://doi.org/10.1016/b978-0-444-64235-6.50101-7openalex-snapshot
Approximation Algorithms for Process Systems Engineering
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124970openalex-snapshot
A novel formulation of the max-cut problem and related algorithm
inferred← citeshttps://doi.org/10.1016/j.asoc.2012.10.015openalex-snapshot
An electromagnetism metaheuristic for solving the Maximum Betweenness Problem
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2019.106599openalex-snapshot
Approximation algorithms for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106681openalex-snapshot
Inverse optimization in semi-definite programs to impute unknown constraint matrices
inferred← citeshttps://doi.org/10.1016/j.cviu.2008.06.002openalex-snapshot
Canonical subsets of image features
inferred← citeshttps://doi.org/10.1016/j.dam.2006.07.014openalex-snapshot
A semidefinite programming-based heuristic for graph coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2007.12.007openalex-snapshot
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
inferred← citeshttps://doi.org/10.1016/j.disc.2006.01.004openalex-snapshot
On NP-hardness of the clique partition—Independence number gap recognition and related problems
inferred← citeshttps://doi.org/10.1016/j.elerap.2012.01.002openalex-snapshot
Discovering target groups in social networking sites: An effective method for maximizing joint influential power
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.05.098openalex-snapshot
Identifying valuable customers on social networking sites for profit maximization
inferred← citeshttps://doi.org/10.1016/j.ijepes.2007.12.003openalex-snapshot
Semidefinite programming for optimal power flow problems
inferred← citeshttps://doi.org/10.1016/j.ijepes.2011.06.003openalex-snapshot
A semidefinite programming method with graph partitioning technique for optimal power flow problems
inferred← citeshttps://doi.org/10.1016/j.ins.2015.05.037openalex-snapshot
Visualizing network communities with a semi-definite programming method
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.08.005openalex-snapshot
On metric properties of maps between Hamming spaces and related graph homomorphisms
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.07.085openalex-snapshot
Highlighting data clusters by graph embedding
inferred← citeshttps://doi.org/10.1016/j.orl.2008.12.009openalex-snapshot
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
inferred← citeshttps://doi.org/10.1016/j.parco.2005.07.002openalex-snapshot
A parallel primal–dual interior-point method for semidefinite programs using positive definite matrix completion
inferred← citeshttps://doi.org/10.1016/j.physa.2024.129951openalex-snapshot
Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources
inferred← citeshttps://doi.org/10.1016/s0005-1098(97)00228-8openalex-snapshot
Management and decision sciences, challenge and opportunities for control and optimization applications
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/s0166-218x(01)00352-3openalex-snapshot
Semidefinite programming for discrete optimization and matrix completion 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/s0167-6377(00)00055-9openalex-snapshot
A probabilistic result for the max-cut problem on random graphs
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00097-xopenalex-snapshot
Semidefinite programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00143-6openalex-snapshot
Semidefinite programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80046-0openalex-snapshot
Bipartite sandwiches: semide?nite relaxations for maximum biclique
inferred← citeshttps://doi.org/10.1017/s0962492906370018openalex-snapshot
Interior-point methods for optimization
inferred← citeshttps://doi.org/10.1023/a:1008655427845openalex-snapshot
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite 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:1014004625997openalex-snapshot
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
inferred← citeshttps://doi.org/10.1023/a:1014895808844openalex-snapshot
Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks
inferred← citeshttps://doi.org/10.1023/a:1017514422146openalex-snapshot
New Complexity Analysis of the Primal–Dual Method for Semidefinite Optimization Based on the Nesterov–Todd Direction
inferred← citeshttps://doi.org/10.1023/a:1026583532263openalex-snapshot
On Copositive Programming and Standard Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1023/b:joco.0000038911.67280.3fopenalex-snapshot
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
inferred← citeshttps://doi.org/10.1038/s41586-023-06071-yopenalex-snapshot
Optimality guarantees for crystal structure prediction
inferred← citeshttps://doi.org/10.1049/iet-gtd:20070516openalex-snapshot
Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraints
inferred← citeshttps://doi.org/10.1051/ro/2018034openalex-snapshot
A guide to conic optimisation and its applications
inferred← citeshttps://doi.org/10.1080/01630563.2014.895763openalex-snapshot
Optimality Conditions in Semidefinite Programming
inferred← citeshttps://doi.org/10.1080/03081087.2012.758261openalex-snapshot
On matrix algebras associated to sum-of-squares semidefinite programs
inferred← citeshttps://doi.org/10.1080/0954898x.2022.2104463openalex-snapshot
A smoothing gradient-based neural network strategy for solving semidefinite programming problems
inferred← citeshttps://doi.org/10.1080/09720502.2003.10700341openalex-snapshot
On the connections between semidefinite optimization and vector optimization
inferred← citeshttps://doi.org/10.1080/10556780108805808openalex-snapshot
The Gauss-Newton direction in semidefinite programming
inferred← citeshttps://doi.org/10.1080/10556789808805715openalex-snapshot
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
inferred← citeshttps://doi.org/10.1080/10556789908805745openalex-snapshot
A study of search directions in primal-dual interior-point methods for semidefinite programming
inferred← citeshttps://doi.org/10.1080/10556789908805769openalex-snapshot
SDPLIB 1.2, a library of semidefinite programming test problems
inferred← citeshttps://doi.org/10.1088/1751-8121/ad2b85openalex-snapshot
Semi-definite programming and quantum information
inferred← citeshttps://doi.org/10.1090/proc/15940openalex-snapshot
A recursive Lovász theta number for simplex-avoiding sets
inferred← citeshttps://doi.org/10.1090/s0894-0347-07-00573-5openalex-snapshot
Euclidean distortion and the sparsest cut
inferred← citeshttps://doi.org/10.1103/lwxq-4myjopenalex-snapshot
Slack-variable approach for variational quantum semidefinite programming
inferred← citeshttps://doi.org/10.1109/ccc.2010.19openalex-snapshot
On the Unique Games Conjecture (Invited Survey)
inferred← citeshttps://doi.org/10.1109/cdc.2006.376783openalex-snapshot
Degree Bounds for Polynomial Verification of the Matrix Cube Problem
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798349openalex-snapshot
A strong semidefinite programming relaxation of the unit commitment problem
inferred← citeshttps://doi.org/10.1109/chinacom.2007.4469461openalex-snapshot
A Fast Decoding Algorithm for Non-orthogonal Frequency Division Multiplexing Signals
inferred← citeshttps://doi.org/10.1109/cvpr.2004.1315212openalex-snapshot
Approximation of canonical sets and their applications to 2D view simplification
inferred← citeshttps://doi.org/10.1109/focs.2006.47openalex-snapshot
Lp metrics on the Heisenberg group and the Goemans-Linial conjecture
inferred← citeshttps://doi.org/10.1109/focs.2009.47openalex-snapshot
A $(\log n)^{\Omega(1)}$ Integrality Gap for the Sparsest Cut SDP
inferred← citeshttps://doi.org/10.1109/focs.2017.45openalex-snapshot
Quantum Speed-Ups for Solving Semidefinite Programs
inferred← citeshttps://doi.org/10.1109/icassp.2006.1661024openalex-snapshot
Codebook Design for Non-Coherent Communication in Multiple-Antenna Systems
inferred← citeshttps://doi.org/10.1109/icpr.2004.1334159openalex-snapshot
Selecting canonical views for view-based 3-D object recognition
inferred← citeshttps://doi.org/10.1109/icsm.2005.78openalex-snapshot
Scenariographer: a tool for reverse engineering class usage scenarios from method invocation sequences
inferred← citeshttps://doi.org/10.1109/itw.2013.6691323openalex-snapshot
Lovasz ϑ, SVMs and applications
inferred← citeshttps://doi.org/10.1109/ndt.2009.5272169openalex-snapshot
Approximation algorithm for correlation clustering
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743498openalex-snapshot
Semidefinite relaxations for parallel machine scheduling
inferred← citeshttps://doi.org/10.1109/sfcs.2005.74openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1
inferred← citeshttps://doi.org/10.1109/spawc.2006.346468openalex-snapshot
Codebook Design for the Non-Coherent GLRT Receiver and Low SNR MIMO Block Fading Channel
inferred← citeshttps://doi.org/10.1109/tci.2019.2948733openalex-snapshot
Generalized Phase Gradient Autofocus Using Semidefinite Relaxation Phase Estimation
inferred← citeshttps://doi.org/10.1109/tpwrs.2012.2214490openalex-snapshot
Conic AC transmission system planning
inferred← citeshttps://doi.org/10.1109/tsp.2005.850882openalex-snapshot
A sparse signal reconstruction perspective for source localization with sensor arrays
inferred← citeshttps://doi.org/10.1109/tsp.2007.901151openalex-snapshot
Noncoherent Communication in Multiple-Antenna Systems: Receiver Design and Codebook Construction
inferred← citeshttps://doi.org/10.1109/tvlsi.2007.904132openalex-snapshot
Minimum Decoupling Capacitor Insertion in VLSI Power/Ground Supply Networks by Semidefinite and Linear Programs
inferred← citeshttps://doi.org/10.1109/wocc.2019.8770640openalex-snapshot
SCMA based resource management of D2D communications for maximum sum-revenue
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2012.00869.xopenalex-snapshot
Semidefinite relaxation for linear programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1137/050641983openalex-snapshot
Approximating K‐means‐type Clustering via Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s1052623498336450openalex-snapshot
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
inferred← citeshttps://doi.org/10.1142/9789814324359_0110openalex-snapshot
L1 Embeddings of the Heisenberg Group and Fast Estimation of Graph Isoperimetry
inferred← citeshttps://doi.org/10.1142/9789814324359_0163openalex-snapshot
Inapproximability of NP-complete Problems, Discrete Fourier Analysis, and Geometry
inferred← citeshttps://doi.org/10.1142/s0217595917500026openalex-snapshot
Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms
inferred← citeshttps://doi.org/10.1142/s0252959905000142openalex-snapshot
SEMI-DEFINITE RELAXATION ALGORITHM FOR SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES
inferred← citeshttps://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferred← citeshttps://doi.org/10.1145/1123008.1123028openalex-snapshot
Efficient decoupling capacitor planning via convex programming methods
inferred← citeshttps://doi.org/10.1145/1132516.1132594openalex-snapshot
Integrality gaps for sparsest cut and minimum linear arrangement problems
inferred← citeshttps://doi.org/10.1145/1361192.1361199openalex-snapshot
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
inferred← citeshttps://doi.org/10.1145/1390156.1390176openalex-snapshot
Spectral clustering with inconsistent advice
inferred← citeshttps://doi.org/10.1145/2488608.2488610openalex-snapshot
A PRG for lipschitz functions of polynomials with applications to sparsest cut
inferred← citeshttps://doi.org/10.1145/2629614openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ 1
inferred← citeshttps://doi.org/10.1145/2783258.2783341openalex-snapshot
Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings
inferred← citeshttps://doi.org/10.1145/3055399.3055413openalex-snapshot
The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n
inferred← citeshttps://doi.org/10.1145/3452021.3458813openalex-snapshot
Approximation Algorithms for Large Scale Data Analysis
inferred← citeshttps://doi.org/10.1145/375827.375840openalex-snapshot
Convex quadratic and semidefinite programming relaxations in scheduling
inferred← citeshttps://doi.org/10.11509/isciesci.42.10_550openalex-snapshot
最適化アルゴリズムの新展開 : 内点法とその周辺IV : 半正定値計画問題II
inferred← citeshttps://doi.org/10.1155/2012/819607openalex-snapshot
A Globally Convergent Filter‐Type Trust Region Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1186/1029-242x-2012-108openalex-snapshot
Sufficient conditions for global optimality of semidefinite optimization
inferred← citeshttps://doi.org/10.1201/b10839-13openalex-snapshot
Numerical Analysis of Cable Networks
inferred← citeshttps://doi.org/10.1287/moor.1120.0584openalex-snapshot
An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
inferred← citeshttps://doi.org/10.1287/moor.2015.0737openalex-snapshot
On Minimal Valid Inequalities for Mixed Integer Conic Programs
inferred← citeshttps://doi.org/10.1287/moor.24.1.1openalex-snapshot
On a Representation of the Matching Polytope Via Semidefinite Liftings
inferred← citeshttps://doi.org/10.1287/moor.26.1.19.10593openalex-snapshot
On the Matrix-Cut Rank of Polyhedra
inferred← citeshttps://doi.org/10.14760/owp-2011-28openalex-snapshot
Infeasibility certificates for linear matrix inequalities
inferred← citeshttps://doi.org/10.15807/jorsj.68.133openalex-snapshot
AN ADDITIVE APPROXIMATION SCHEME FOR THE NASH SOCIAL WELFARE MAXIMIZATION WITH IDENTICAL ADDITIVE VALUATIONS
inferred← citeshttps://doi.org/10.22331/q-2023-07-12-1057openalex-snapshot
Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints
inferred← citeshttps://doi.org/10.2298/yjor201223001lopenalex-snapshot
Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems
inferred← citeshttps://doi.org/10.3138/infor.53.1.40openalex-snapshot
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
inferred← citeshttps://doi.org/10.3166/ejc.9.307-321openalex-snapshot
Semidefinite Programming Relaxations and Algebraic Optimization in Control
inferred← citeshttps://doi.org/10.32657/10356/48908openalex-snapshot
An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming
inferred← citeshttps://doi.org/10.3390/math10214009openalex-snapshot
An SDP Dual Relaxation for the Robust Shortest-Path Problem with Ellipsoidal Uncertainty: Pierra’s Decomposition Method and a New Primal Frank–Wolfe-Type Heuristics for Duality Gap Evaluation
inferred← citeshttps://doi.org/10.3390/math12203202openalex-snapshot
Constraint Qualifications and Optimality Conditions for Nonsmooth Semidefinite Multiobjective Programming Problems with Mixed Constraints Using Convexificators
inferred← citeshttps://doi.org/10.4007/annals.2018.188.1.4openalex-snapshot
Vertical perimeter versus horizontal perimeter
inferred← citeshttps://doi.org/10.4310/mrl.2011.v18.n6.a9openalex-snapshot
A Characterization of bi-Lipschitz embeddable metric spaces in terms of local bi-Lipschitz embeddability
inferred← citeshttps://doi.org/10.48550/arxiv.2004.01869openalex-snapshot
Learning with Semi-Definite Programming: new statistical bounds based on fixed point analysis and excess risk curvature
inferred← citeshttps://doi.org/10.48550/arxiv.math/9907109openalex-snapshot
Bipartite sandwiches: bounding the size of a maximum biclique
inferred← citeshttps://doi.org/10.52326/ic-ecco.2022/cs.01openalex-snapshot
A Method for Binary Quadratic Programming with Circulant Matrix
inferred← citeshttps://doi.org/10.5555/1070432.1070446openalex-snapshot
On distance scales, embeddings, and efficient relaxations of the cut cone
inferred← citeshttps://doi.org/10.5555/1496770.1496900openalex-snapshot
Improved approximation bound for quadratic optimization problems with orthogonality constraints
inferred← citeshttps://doi.org/10.5802/crmath.447openalex-snapshot
Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain
inferred← citeshttps://doi.org/10.5802/tsg.253openalex-snapshot
Plongements quasiisométriques du groupe de Heisenberg dans L p , d’après Cheeger, Kleiner, Lee, Naor
inferred← citeshttps://doi.org/10.70675/737c4291z0528z4c67za7c4ze0317528819copenalex-snapshot
Optimizing the imbalances in a graph
inferred← citeshttps://doi.org/10.7916/d8tf04rgopenalex-snapshot
Cutting Planes for Convex Objective Nonconvex Optimization
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.