On the public citation graph
Recognition problems for special classes of polynomials in 0–1 variables
0 signed · 63 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/net.3230150206openalex-snapshot
Minimum cuts, modular functions, and matroid polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/978-3-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1007/bf01580647openalex-snapshot
Low order polynomial bounds on the expected performance of local improvement algorithms
inferredcites →https://doi.org/10.1007/bf01584094openalex-snapshot
Discrete optimization on a multivariable boolean lattice
inferredcites →https://doi.org/10.1007/bf01589108openalex-snapshot
On the supermodular knapsack problem
inferredcites →https://doi.org/10.1007/bf01949713openalex-snapshot
A note on the monotonicity of pseudo-Boolean functions
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02579361openalex-snapshot
On submodular function minimization
inferredcites →https://doi.org/10.1016/0166-218x(85)90035-6openalex-snapshot
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
inferredcites →https://doi.org/10.1016/s0167-5060(08)70343-1openalex-snapshot
Methods of Nonlinear 0-1 Programming
inferredcites →https://doi.org/10.1137/0401019openalex-snapshot
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
inferredcites →https://doi.org/10.1137/0606040openalex-snapshot
Hill Climbing with Multiple Local Optima
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118600245.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1002/9781119005216.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1007/11425076_1openalex-snapshot
Efficient Pruning Technique Based on Linear Relaxations
inferred← citeshttps://doi.org/10.1007/3-540-60437-5_16openalex-snapshot
Boolean approach for representing and solving constraint-satisfaction problems
inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_27openalex-snapshot
Towards the Biconjugate of Bivariate Piecewise Quadratic Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_8openalex-snapshot
Classes of Submodular Constraints Expressible by Graph Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_63openalex-snapshot
The Expressive Power of Binary Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-33885-4_28openalex-snapshot
Tighter Relaxations for Higher-Order Models Based on Generalized Roof Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-33974-5_4openalex-snapshot
Expressibility of Submodular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-33974-5_5openalex-snapshot
Non-expressibility of Submodular Languages
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_8openalex-snapshot
Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1007/bf01582138openalex-snapshot
Concave extensions for nonlinear 0–1 maximization problems
inferred← citeshttps://doi.org/10.1007/bfb0023911openalex-snapshot
A 0–1 quadratic knapsack problem for modelizing and solving the constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s10107-012-0581-4openalex-snapshot
Explicit convex and concave envelopes through polyhedral subdivisions
inferred← citeshttps://doi.org/10.1007/s10107-012-0616-xopenalex-snapshot
On convex envelopes for bivariate functions over polytopes
inferred← citeshttps://doi.org/10.1007/s10107-024-02122-yopenalex-snapshot
The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10589-026-00781-5openalex-snapshot
Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
inferred← citeshttps://doi.org/10.1007/s10601-009-9078-zopenalex-snapshot
Classes of submodular constraints expressible by graph cuts
inferred← citeshttps://doi.org/10.1007/s10732-008-9074-2openalex-snapshot
A cross entropy based algorithm for reliability problems
inferred← citeshttps://doi.org/10.1007/s10898-016-0418-4openalex-snapshot
Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
inferred← citeshttps://doi.org/10.1007/s10898-025-01503-7openalex-snapshot
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
inferred← citeshttps://doi.org/10.1007/s10898-026-01620-xopenalex-snapshot
Continuous formulations for combinatorial optimization problems based on the probabilistic method
inferred← citeshttps://doi.org/10.1007/s12532-014-0073-zopenalex-snapshot
Global optimization of nonconvex problems with multilinear intermediates
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00052-fopenalex-snapshot
Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00161-6openalex-snapshot
On the geometric separability of Boolean functions
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90043-3openalex-snapshot
Complexity of uniqueness and local search in quadratic 0–1 programming
inferred← citeshttps://doi.org/10.1016/j.cor.2007.10.028openalex-snapshot
Tabu search-based metaheuristic algorithm for software system reliability problems
inferred← citeshttps://doi.org/10.1016/j.dam.2009.07.001openalex-snapshot
The expressive power of binary submodular functions
inferred← citeshttps://doi.org/10.1016/j.orl.2013.04.004openalex-snapshot
Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00026-1openalex-snapshot
A lower bound for a constrained quadratic 0–1 minimization problem
inferred← citeshttps://doi.org/10.1023/a:1008217604285openalex-snapshot
A Convex Envelope Formula for Multilinear Functions
inferred← citeshttps://doi.org/10.1023/a:1011295715398openalex-snapshot
Analysis of Bounds for Multilinear Functions
inferred← citeshttps://doi.org/10.1023/b:jogo.0000042112.72379.e6openalex-snapshot
Trilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes
inferred← citeshttps://doi.org/10.1080/10556788.2014.916287openalex-snapshot
Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
inferred← citeshttps://doi.org/10.1109/coginfocom.2012.6421992openalex-snapshot
VirCA NET and CogInfoCom: Novel challenges in future internet based augmented/Virtual Collaboration
inferred← citeshttps://doi.org/10.1137/22m1515537openalex-snapshot
MIP Relaxations in Factorable Programming
inferred← citeshttps://doi.org/10.1137/s0036142903436174openalex-snapshot
Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
inferred← citeshttps://doi.org/10.1287/moor.2014.0657openalex-snapshot
Polynomially Computable Bounds for the Probability of the Union of Events
inferred← citeshttps://doi.org/10.1287/moor.2021.1162openalex-snapshot
Tractable Relaxations of Composite Functions
inferred← citeshttps://doi.org/10.1613/jair.5023openalex-snapshot
Quadratization and Roof Duality of Markov Logic Networks
inferred← citeshttps://doi.org/10.3233/fi-1998-35123405openalex-snapshot
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
inferred← citeshttps://doi.org/10.37236/29openalex-snapshot
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
inferred← citeshttps://doi.org/10.5772/13365openalex-snapshot
Some Special Traveling Salesman Problems with Applications in Health Economics
inferred← citeshttps://doi.org/10.7282/t3pz5bhqopenalex-snapshot
Algorithmic and complexity results for boolean and pseudo-boolean functions
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.