On the public citation graph

Integer Optimization on Convex Semialgebraic Sets

0 signed · 61 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/3-540-54458-5_56openalex-snapshot
A geometrical bound for integer programming with polynomial constraints
inferredcites →https://doi.org/10.1007/978-1-4612-5412-6_25openalex-snapshot
Extremum Problems with Inequalities as Subsidiary Conditions
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_9openalex-snapshot
Extremum Problems with Inequalities as Subsidiary Conditions
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-7091-7551-4_16openalex-snapshot
Some Useful Bounds
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/sfcs.1997.646093openalex-snapshot
An improved algorithm for quantifier elimination over real closed fields
inferredcites →https://doi.org/10.1137/0221060openalex-snapshot
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
inferredcites →https://doi.org/10.1145/235809.235813openalex-snapshot
On the combinatorial and algebraic complexity of quantifier elimination
inferredcites →https://doi.org/10.1145/321662.321665openalex-snapshot
On Euclid's Algorithm and the Theory of Subresultants
inferredcites →https://doi.org/10.1287/moor.19.4.769openalex-snapshot
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.2307/2310752openalex-snapshot
An Introduction to Diophantine Approximation.
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.24033/bsmf.2210openalex-snapshot
Une borne optimale pour la programmation entière quasi-convexe

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_19openalex-snapshot
On the Complexity of Nonlinear Mixed-Integer Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-22629-9_16openalex-snapshot
Integer Conic Function Minimization Based on the Comparison Oracle
inferred← citeshttps://doi.org/10.1007/978-3-030-63072-0_21openalex-snapshot
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_15openalex-snapshot
Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_28openalex-snapshot
Graph Layout Problems Parameterized by Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_20openalex-snapshot
Integer Quadratic Quasi-polyhedra
inferred← citeshttps://doi.org/10.1007/s00186-017-0608-yopenalex-snapshot
Norm bounds and underestimators for unconstrained polynomial integer minimization
inferred← citeshttps://doi.org/10.1007/s10035-024-01456-wopenalex-snapshot
Cluster-based particle tracking velocimetry algorithm combining the quasi-parallel correction in granular motions reconstruction
inferred← citeshttps://doi.org/10.1007/s10107-012-0545-8openalex-snapshot
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
inferred← citeshttps://doi.org/10.1007/s10107-012-0609-9openalex-snapshot
Unbounded convex sets for non-convex mixed-integer quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-019-01402-2openalex-snapshot
Combinatorial n-fold integer programming and applications
inferred← citeshttps://doi.org/10.1007/s10107-022-01862-zopenalex-snapshot
Complexity of optimizing over the integers
inferred← citeshttps://doi.org/10.1007/s10898-018-0729-8openalex-snapshot
On the complexity of quasiconvex integer minimization problem
inferred← citeshttps://doi.org/10.1007/s10951-017-0550-0openalex-snapshot
Scheduling meets n-fold integer programming
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.023openalex-snapshot
Scientific contributions of Leo Khachiyan (a short overview)
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.006openalex-snapshot
A polynomial algorithm for minimizing discrete convic functions in fixed dimension
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.003openalex-snapshot
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn)
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100596openalex-snapshot
Integer programming in parameterized complexity: Five miniatures
inferred← citeshttps://doi.org/10.1016/j.jco.2005.04.004openalex-snapshot
Complexity of integer quasiconvex polynomial optimization
inferred← citeshttps://doi.org/10.1016/j.orl.2014.07.005openalex-snapshot
Integer convex minimization by mixed integer linear optimization
inferred← citeshttps://doi.org/10.1016/j.pmcj.2020.101215openalex-snapshot
Adaptive streaming of HD and 360 ° videos over software defined radios
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.017openalex-snapshot
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting
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.1017/s0962492913000032openalex-snapshot
Mixed-integer nonlinear optimization
inferred← citeshttps://doi.org/10.1090/pspum/111/02040openalex-snapshot
The nonlinear algebra view of discrete mathematics
inferred← citeshttps://doi.org/10.1103/physreva.95.062314openalex-snapshot
Quantum resource theories in the single-shot regime
inferred← citeshttps://doi.org/10.1103/physrevb.101.100301openalex-snapshot
Is there a Floquet Lindbladian?
inferred← citeshttps://doi.org/10.1134/s199047892001007xopenalex-snapshot
Minimization of Even Conic Functions on the Two-Dimensional Integral Lattice
inferred← citeshttps://doi.org/10.1137/090772459openalex-snapshot
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch118openalex-snapshot
An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra
inferred← citeshttps://doi.org/10.1137/21m139935xopenalex-snapshot
Enumerating Integer Points in Polytopes with Bounded Subdeterminants
inferred← citeshttps://doi.org/10.1145/2465506.2465949openalex-snapshot
Computing rational solutions of linear matrix inequalities
inferred← citeshttps://doi.org/10.1145/3286487openalex-snapshot
On the Decidability of Membership in Matrix-exponential Semigroups
inferred← citeshttps://doi.org/10.1145/3326229.3326262openalex-snapshot
Computing the Volume of Compact Semi-Algebraic Sets
inferred← citeshttps://doi.org/10.1287/moor.1050.0169openalex-snapshot
Integer Polynomial Optimization in Fixed Dimension
inferred← citeshttps://doi.org/10.1287/moor.2015.0738openalex-snapshot
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
inferred← citeshttps://doi.org/10.1365/s13291-012-0055-xopenalex-snapshot
Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods
inferred← citeshttps://doi.org/10.33048/daio.2020.27.654openalex-snapshot
Minimization of even conic functions on the two-dimensional integral lattice
inferred← citeshttps://doi.org/10.48550/arxiv.0910.2973openalex-snapshot
Computing rational points in convex semi-algebraic sets and SOS decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1405.5088openalex-snapshot
Quadratic integer programming and the slope conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1511.00310openalex-snapshot
Parameterized Integer Quadratic Programming: Variables and Coefficients
inferred← citeshttps://doi.org/10.48550/arxiv.1904.11705openalex-snapshot
Computing the volume of compact semi-algebraic sets
inferred← citeshttps://doi.org/10.53846/goediss-6621openalex-snapshot
Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming
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.