On the public citation graph
Approximation algorithms for indefinite quadratic programming
0 signed · 100 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.1002/nav.3800330106openalex-snapshot
A lagrangean relaxation algorithm for the constrained matrix problem
inferredcites →https://doi.org/10.1007/bf00120662openalex-snapshot
Quadratic programming with one negative eigenvalue is NP-hard
inferredcites →https://doi.org/10.1007/bf01581085openalex-snapshot
Approximation algorithms for indefinite quadratic programming
inferredcites →https://doi.org/10.1007/bf01586048openalex-snapshot
Local minima for indefinite quadratic knapsack problems
inferredcites →https://doi.org/10.1007/bf01587086openalex-snapshot
An extension of Karmarkar's projective algorithm for convex quadratic programming
inferredcites →https://doi.org/10.1007/bf01588328openalex-snapshot
A polynomially bounded algorithm for a singly constrained quadratic program
inferredcites →https://doi.org/10.1007/bf01588800openalex-snapshot
On the solution of concave knapsack problems
inferredcites →https://doi.org/10.1007/bf02592948openalex-snapshot
Some NP-complete problems in quadratic and nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0000035openalex-snapshot
Constrained Global Optimization: Algorithms and Applications
inferredcites →https://doi.org/10.1016/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferredcites →https://doi.org/10.1016/0020-0190(90)90100-copenalex-snapshot
Quadratic programming is in NP
inferredcites →https://doi.org/10.1016/0041-5553(80)90098-1openalex-snapshot
The polynomial solvability of convex quadratic programming
inferredcites →https://doi.org/10.1016/0167-6377(84)90010-5openalex-snapshot
An O(n) algorithm for quadratic knapsack problems
inferredcites →https://doi.org/10.1016/0378-4754(84)90101-0openalex-snapshot
Problem complexity and method efficiency in optimization
inferredcites →https://doi.org/10.1109/sfcs.1989.63499openalex-snapshot
Speeding-up linear programming using fast matrix multiplication
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/1.9781611970203openalex-snapshot
An Algorithmic Theory of Numbers, Graphs and Convexity
inferredcites →https://doi.org/10.1145/12130.12145openalex-snapshot
Fast algorithms for convex quadratic programming and multicommodity flows
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.1515/9781400862528openalex-snapshot
Recent Advances in Global Optimization
inferredcites →https://doi.org/10.1515/9781400862528.3openalex-snapshot
On approximation algorithms for concave quadratic programming
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2581380openalex-snapshot
Problem Complexity and Method Efficiency in Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_65openalex-snapshot
Complexity Theory: Quadratic Programming
inferred← citeshttps://doi.org/10.1007/11758471_7openalex-snapshot
Quadratic Programming and Combinatorial Minimum Weight Product Problems
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_27openalex-snapshot
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_81openalex-snapshot
Complexity Theory: Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_2openalex-snapshot
Complexity Issues in Global Optimization: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4757-2600-8_5openalex-snapshot
Quadratic Programming with Box Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_30openalex-snapshot
Algorithms for Playing Games with Limited Randomness
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_24openalex-snapshot
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
inferred← citeshttps://doi.org/10.1007/978-3-642-25510-6_35openalex-snapshot
Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses
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/bf01100203openalex-snapshot
A reformulation-convexification approach for solving nonconvex quadratic programming problems
inferred← citeshttps://doi.org/10.1007/bf01581088openalex-snapshot
Open questions in complexity theory for numerical optimization
inferred← citeshttps://doi.org/10.1007/bf01585569openalex-snapshot
The complexity of approximating a nonlinear program
inferred← citeshttps://doi.org/10.1007/bf01585768openalex-snapshot
A trust-region strategy for minimization on arbitrary domains
inferred← citeshttps://doi.org/10.1007/s00182-008-0129-2openalex-snapshot
Separable and low-rank continuous games
inferred← citeshttps://doi.org/10.1007/s001860200239openalex-snapshot
Approximation algorithms for the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s00199-009-0436-2openalex-snapshot
Games of fixed rank: a hierarchy of bimatrix games
inferred← citeshttps://doi.org/10.1007/s10107-006-0047-7openalex-snapshot
Quadratic programming and combinatorial minimum weight product problems
inferred← citeshttps://doi.org/10.1007/s10107-009-0287-4openalex-snapshot
An FPTAS for minimizing the product of two non-negative linear cost functions
inferred← citeshttps://doi.org/10.1007/s10107-011-0511-xopenalex-snapshot
An FPTAS for optimizing a class of low-rank functions over a polytope
inferred← citeshttps://doi.org/10.1007/s10107-015-0918-xopenalex-snapshot
An efficient global algorithm for a class of indefinite separable quadratic programs
inferred← citeshttps://doi.org/10.1007/s10107-017-1178-8openalex-snapshot
On approximation algorithms for concave mixed-integer quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-022-01907-3openalex-snapshot
An approximation algorithm for indefinite mixed integer quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-024-02079-yopenalex-snapshot
A normal fan projection algorithm for low-rank optimization
inferred← citeshttps://doi.org/10.1007/s10589-007-9156-3openalex-snapshot
A FPTAS for a class of linear multiplicative problems
inferred← citeshttps://doi.org/10.1007/s10589-023-00488-xopenalex-snapshot
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
inferred← citeshttps://doi.org/10.1007/s10618-021-00811-2openalex-snapshot
Provable randomized rounding for minimum-similarity diversification
inferred← citeshttps://doi.org/10.1007/s10878-025-01339-7openalex-snapshot
Bivalent quadratic optimization with sum-of-square of quadratic penalties
inferred← citeshttps://doi.org/10.1007/s10898-011-9813-zopenalex-snapshot
Approximation algorithm for a class of global optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-008-9448-5openalex-snapshot
Complexity Results for Some Global Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11075-009-9358-0openalex-snapshot
A new algorithm for the general quadratic programming problems with box constraints
inferred← citeshttps://doi.org/10.1007/s11075-020-01065-7openalex-snapshot
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
inferred← citeshttps://doi.org/10.1007/s11590-010-0188-8openalex-snapshot
New formulations of the multiple sequence alignment problem
inferred← citeshttps://doi.org/10.1007/s12532-018-0142-9openalex-snapshot
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.09.007openalex-snapshot
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.04.004openalex-snapshot
Indefinite multi-constrained separable quadratic optimization: Large-scale efficient solution
inferred← citeshttps://doi.org/10.1016/j.jco.2011.06.001openalex-snapshot
Complexity bounds for second-order optimality in unconstrained optimization
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.009openalex-snapshot
Trading performance for stability in Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.orl.2009.07.002openalex-snapshot
Optimization of a convex program with a polynomial perturbation
inferred← citeshttps://doi.org/10.1016/j.orl.2013.01.004openalex-snapshot
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.002openalex-snapshot
A better differential approximation ratio for symmetric TSP
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.016openalex-snapshot
On mutual concavity and strategically-zero-sum bimatrix games
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00099-6openalex-snapshot
Differential approximation algorithms for some combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00222-9openalex-snapshot
Differential approximation results for the traveling salesman problem with distances 1 and 2
inferred← citeshttps://doi.org/10.1023/a:1008240227198openalex-snapshot
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems
inferred← citeshttps://doi.org/10.1023/a:1008293029350openalex-snapshot
A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints
inferred← citeshttps://doi.org/10.1023/a:1016351614255openalex-snapshot
A Multivariate Partition Approach to Optimization Problems
inferred← citeshttps://doi.org/10.1051/ro/1996300100311openalex-snapshot
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
inferred← citeshttps://doi.org/10.1051/ro:2003008openalex-snapshot
Differential approximation of NP-hard problems with equal size feasible solutions
inferred← citeshttps://doi.org/10.1080/02331930108844555openalex-snapshot
A continuous approch for globally solving linearly constrained quadratic
inferred← citeshttps://doi.org/10.1109/cdc.2006.377023openalex-snapshot
Separable and Low-Rank Continuous Games
inferred← citeshttps://doi.org/10.1109/icnsc.2013.6548769openalex-snapshot
Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567056openalex-snapshot
Beyond convex relaxation: A polynomial-time non-convex optimization approach to network localization
inferred← citeshttps://doi.org/10.1109/lics.2013.39openalex-snapshot
Trading Performance for Stability in Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/tfuzz.2021.3129848openalex-snapshot
Semisupervised Fuzzy Clustering With Fuzzy Pairwise Constraints
inferred← citeshttps://doi.org/10.1137/18m121873xopenalex-snapshot
Subdeterminants and Concave Integer Quadratic Programming
inferred← citeshttps://doi.org/10.1145/3174800openalex-snapshot
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
inferred← citeshttps://doi.org/10.1186/s13660-017-1342-yopenalex-snapshot
Linear decomposition approach for a class of nonconvex programming problems
inferred← citeshttps://doi.org/10.1186/s40064-016-2735-yopenalex-snapshot
A range division and contraction approach for nonconvex quadratic program with quadratic constraints
inferred← citeshttps://doi.org/10.1201/9781420010749.ch16openalex-snapshot
Differential Ratio Approximation
inferred← citeshttps://doi.org/10.1214/15-aos1380openalex-snapshot
Global solutions to folded concave penalized nonconvex learning
inferred← citeshttps://doi.org/10.1287/ijoc.2020.1017openalex-snapshot
A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
inferred← citeshttps://doi.org/10.1590/0101-7438.2014.034.03.0447openalex-snapshot
TRUST-REGION-BASED METHODS FOR NONLINEAR PROGRAMMING: RECENT ADVANCES AND PERSPECTIVES
inferred← citeshttps://doi.org/10.24193/subbmath.2024.1.15openalex-snapshot
A polynomial algorithm for some instances of NP-complete problems
inferred← citeshttps://doi.org/10.47749/t/unicamp.1994.76727openalex-snapshot
Regiões de confiança em programação matematica
inferred← citeshttps://doi.org/10.48550/arxiv.2105.02543openalex-snapshot
Bayesian Active Learning by Disagreements: A Geometric Perspective
inferred← citeshttps://doi.org/10.5555/1283383.1283504openalex-snapshot
Games of fixed rank: a hierarchy of bimatrix games
inferred← citeshttps://doi.org/10.7907/kh85-hj73.openalex-snapshot
Limited Randomness in Games, and Computational Perspectives in Revealed Preference
showing the first 72 of 73 · page through all 73
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.