On the public citation graph
Quadratic functions of binary variables
0 signed · 58 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.1007/978-3-0348-5321-7_5openalex-snapshot
Linear Decomposition of a Positive Group-Boolean Function
inferredcites →https://doi.org/10.1007/978-3-0348-6322-3openalex-snapshot
Konstruktive Methoden der finiten nichtlinearen Optimierung
inferredcites →https://doi.org/10.1007/978-3-0348-6322-3_1openalex-snapshot
Some Remarks on Conflict Graphs of Quadratic Pseudo-Boolean Functions
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/978-94-011-7557-9_21openalex-snapshot
Fonctions D’evaluation Et Penalites Pour Les Programmes Quadratiques En Variables 0–1
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/bf01580586openalex-snapshot
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferredcites →https://doi.org/10.1007/bfb0121007openalex-snapshot
Node-weighted graphs having the König-Egerváry property
inferredcites →https://doi.org/10.1016/0020-0190(77)90068-0openalex-snapshot
Testing for equality between maximum matching and minimum node covering
inferredcites →https://doi.org/10.1016/0020-0190(79)90002-4openalex-snapshot
A linear-time algorithm for testing the truth of certain quantified boolean formulas
inferredcites →https://doi.org/10.1016/0020-0190(80)90049-6openalex-snapshot
A switching algorithm for the solution of quadratic boolean equations
inferredcites →https://doi.org/10.1016/0166-218x(86)90032-6openalex-snapshot
An asymptotically exact polynomial algorithm for equipartition problems
inferredcites →https://doi.org/10.1016/0377-2217(84)90093-6openalex-snapshot
Quadratic assignment problems
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50019-7openalex-snapshot
UPPER PLANES OF QUADRATIC 0–1 FUNCTIONS AND STABILITY IN GRAPHS
inferredcites →https://doi.org/10.1016/s0167-5060(08)70043-8openalex-snapshot
Quasimonotone Boolean Functions and Bistellar Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70731-3openalex-snapshot
Aggregation of Inequalities in Integer Programming
inferredcites →https://doi.org/10.1016/s0304-0208(08)72450-2openalex-snapshot
Degree-two Inequalities, Clique Facets, and Biperfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73112-8openalex-snapshot
Consistency of Quadratic Boolean Equations and the König-Egerváry Property for Graphs°°The present Work is part of a doctoral thesis written at the Department of Combinatorics and Optimization, University of Waterloo, under the supervision of Prof. P.L. Hammer.
inferredcites →https://doi.org/10.1057/jors.1976.126openalex-snapshot
Combinatorial Programming: Methods and Applications
inferredcites →https://doi.org/10.1080/00029890.1952.11988183openalex-snapshot
The Problem of Simplifying Truth Functions
inferredcites →https://doi.org/10.1093/biomet/54.3-4.357openalex-snapshot
The Discarding of Variables in Multivariate Analysis
inferredcites →https://doi.org/10.1109/sfcs.1975.21openalex-snapshot
On the complexity of time table and multi-commodity flow problems
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/0603052openalex-snapshot
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
inferredcites →https://doi.org/10.1287/mnsc.17.3.200openalex-snapshot
A Selection Problem of Shared Fixed Costs and Network Flows
inferredcites →https://doi.org/10.1287/moor.1.3.251openalex-snapshot
A Successive Underestimation Method for Concave Minimization Problems
inferredcites →https://doi.org/10.1287/opre.14.1.1openalex-snapshot
A Mathematical Model of Supply Support for Space Operations
inferredcites →https://doi.org/10.1307/mmj/1028989917openalex-snapshot
On the notion of balance of a signed graph.
inferredcites →https://doi.org/10.4153/cjm-1965-016-2openalex-snapshot
Some Properties of Graphs with Multiple Edges
inferredcites →https://doi.org/10.6028/nbs.ir.75-737openalex-snapshot
Mathematical methods of site selection for electronic message systems (EMS)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199008)37:4<527::aid-nav3220370407>3.0.co;2-popenalex-snapshot
An algorithm for quadratic zero-one programs
inferred← citeshttps://doi.org/10.1007/3-540-45683-x_15openalex-snapshot
Two Transformations of Clauses into Constraints and Their Properties for Cost-Based Hypothetical Reasoning
inferred← citeshttps://doi.org/10.1007/978-0-387-36721-7_7openalex-snapshot
Pseudo-Boolean Optimization in Case of an Unconnected Feasible Set
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_12openalex-snapshot
Special Cases of Hard Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_9openalex-snapshot
Quadratic 0-1 Programming
inferred← citeshttps://doi.org/10.1007/bf01582138openalex-snapshot
Concave extensions for nonlinear 0–1 maximization problems
inferred← citeshttps://doi.org/10.1007/s11741-998-0079-8openalex-snapshot
Neural networks for logic circuits
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90256-aopenalex-snapshot
A solvable class of quadratic 0–1 programming
inferred← citeshttps://doi.org/10.1016/0305-0548(92)90067-fopenalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50007-1openalex-snapshot
BOOLEAN-COMBINATORIAL BOUNDING OF MAXIMUM 2-SATISFIABILITY
inferred← citeshttps://doi.org/10.1016/j.dam.2003.09.007openalex-snapshot
Block linear majorants in quadratic 0–1 optimization
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.021openalex-snapshot
A pseudo-Boolean consensus approach to nonlinear 0–1 optimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1109/69.469822openalex-snapshot
Quasi-acyclic propositional Horn knowledge bases: optimal compression
inferred← citeshttps://doi.org/10.1109/hicss.1994.323341openalex-snapshot
Graph-based methods for Horn knowledge compression
inferred← citeshttps://doi.org/10.1109/isvd.1991.185104openalex-snapshot
A novel VLSI solution to a difficult graph problem
inferred← citeshttps://doi.org/10.1287/mnsc.44.3.336openalex-snapshot
Adaptive Memory Tabu Search for Binary Quadratic Programs
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.