On the public citation graph
Computational experience with an interior point algorithm on the satisfiability problem
0 signed · 81 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-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf01531074openalex-snapshot
Branch-and-cut solution of inference problems in propositional logic
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/bf01582907openalex-snapshot
An interior point algorithm to solve computationally difficult set covering problems
inferredcites →https://doi.org/10.1007/bf02186368openalex-snapshot
Generalized resolution and cutting planes
inferredcites →https://doi.org/10.1016/0167-6377(88)90044-2openalex-snapshot
Resolution vs. cutting plane solution of inference problems: Some computational experience
inferredcites →https://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot
A quantitative approach to logical inference
inferredcites →https://doi.org/10.1016/0167-9236(88)90128-5openalex-snapshot
Computation-oriented reductions of predicate to propositional logic
inferredcites →https://doi.org/10.1016/0305-0548(86)90056-0openalex-snapshot
Some results and experiments in programming techniques for propositional logic
inferredcites →https://doi.org/10.1016/0305-0548(90)90062-copenalex-snapshot
Modeling and integer programming techniques applied to propositional calculus
inferredcites →https://doi.org/10.1016/s0020-7373(88)80074-9openalex-snapshot
A mathematical programming approach to inference with the capability of implementing default rules
inferredcites →https://doi.org/10.1090/qam/10666openalex-snapshot
A method for the solution of certain non-linear problems in least squares
inferredcites →https://doi.org/10.1137/0111030openalex-snapshot
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
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_277openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_5openalex-snapshot
Interior Point and Semidefinite Approaches in Combinatorial Optimization
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/11424925_22openalex-snapshot
Differential Approximation of min sat, max sat and Related Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_364openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_8openalex-snapshot
Randomized Backtrack Search
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_5openalex-snapshot
Parallel Algorithms for Satisfiability (SAT) Testing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_2openalex-snapshot
Approximate Algorithms and Heuristics for MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_4openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_11openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_12openalex-snapshot
Interior Point Methods for Global Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-4102-8_9openalex-snapshot
Some Recent Developments of Using Logical Analysis for Inferring a Boolean Function with Few Clauses
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_364-1openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-15455-2_3openalex-snapshot
Reactive Tabu Search for MAX-SAT, an Analysis of Sampling Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_1openalex-snapshot
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
inferred← citeshttps://doi.org/10.1007/bf00171827openalex-snapshot
A continuous method for computing bounds in integer quadratic optimization problems
inferred← citeshttps://doi.org/10.1007/bf01097004openalex-snapshot
Inference of a minimum size boolean function from examples by using a new efficient branch-and-bound approach
inferred← citeshttps://doi.org/10.1007/bf01581082openalex-snapshot
A continuous approach to inductive inference
inferred← citeshttps://doi.org/10.1007/bf02027814openalex-snapshot
New methods for computing inferences in first order logic
inferred← citeshttps://doi.org/10.1007/bf02127973openalex-snapshot
A BDD SAT solver for satisfiability testing: An industrial case study
inferred← citeshttps://doi.org/10.1007/bf02192047openalex-snapshot
Matrix representation and gradient flows for NP-hard problems
inferred← citeshttps://doi.org/10.1007/bf02283687openalex-snapshot
Interior-point algorithms for global optimization
inferred← citeshttps://doi.org/10.1007/bf02952482openalex-snapshot
On optimizing the satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1007/bf03038310openalex-snapshot
A quantitative solution to Constraint Satisfaction Problem (CSP)
inferred← citeshttps://doi.org/10.1007/bfb0023767openalex-snapshot
Logical inference and polyhedral projection
inferred← citeshttps://doi.org/10.1007/s11390-005-0002-8openalex-snapshot
Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00045-3openalex-snapshot
Generating hard satisfiability problems
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00049-6openalex-snapshot
Some pitfalls for experimenters with random SAT
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90051-5openalex-snapshot
Generating logical expressions from positive and negative examples via a branch-and-bound approach
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00075-5openalex-snapshot
On the minimum number of logical clauses inferred from examples
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00199-9openalex-snapshot
Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00234-0openalex-snapshot
An approach to guided learning of boolean functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.04.057openalex-snapshot
Differential approximation of min sat, max sat and related problems
inferred← citeshttps://doi.org/10.1016/s0020-0255(03)00065-3openalex-snapshot
Experimental complexity analysis of continuous constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00249-3openalex-snapshot
Solving satisfiability problems using elliptic approximations – effective branching rules
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00139-4openalex-snapshot
A potential reduction approach to the frequency assignment problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00031-xopenalex-snapshot
Potential reduction algorithms for structured combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00299-0openalex-snapshot
Differential approximation for optimal satisfiability and related problems
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)x0300-6openalex-snapshot
Handbook of Knowledge Representation
inferred← citeshttps://doi.org/10.1023/a:1006314320276openalex-snapshot
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1023/a:1008287028851openalex-snapshot
A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems
inferred← citeshttps://doi.org/10.1063/5.0018058openalex-snapshot
Developing random satisfiability logic programming in Hopfield neural network
inferred← citeshttps://doi.org/10.1109/12.485373openalex-snapshot
Convergence properties of optimization algorithms for the SAT problem
inferred← citeshttps://doi.org/10.1109/21.247892openalex-snapshot
Local search for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/69.334864openalex-snapshot
Global optimization for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343098openalex-snapshot
An interior point approach to Boolean vector function synthesis
inferred← citeshttps://doi.org/10.1109/tai.1998.744839openalex-snapshot
Improving the performance of discrete Lagrange-multiplier search for solving hard SAT problems
inferred← citeshttps://doi.org/10.1109/tcset49122.2020.235507openalex-snapshot
Boolean Satisfiability Problem: Discrete and Continuous Reformulations with Applications
inferred← citeshttps://doi.org/10.1109/tnet.2011.2111462openalex-snapshot
Practical Computation of Optimal Schedules in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1111/1475-3995.00385openalex-snapshot
A hybrid search combining interior point methods and metaheuristics for 0–1 programming
inferred← citeshttps://doi.org/10.1126/science.264.5163.1297openalex-snapshot
Critical Behavior in the Satisfiability of Random Boolean Expressions
inferred← citeshttps://doi.org/10.1287/ijoc.10.3.301openalex-snapshot
An Incremental Branch-and-Bound Method for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1287/ijoc.7.3.283openalex-snapshot
A Relationship Between CNF and DNF Systems Derivable from Examples
inferred← citeshttps://doi.org/10.1287/opre.50.6.968.353openalex-snapshot
Algorithms for Radio Link Frequency Assignment: The Calma Project
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.114.7-8_796openalex-snapshot
An Algorithm for β Clause Satisfiability Problem in Propositional Logic
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16502openalex-snapshot
On Continuous Local BDD-Based Search for Hybrid SAT Solving
inferred← citeshttps://doi.org/10.4108/icst.wicon2008.4862openalex-snapshot
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
inferred← citeshttps://doi.org/10.5555/1554126.1554145openalex-snapshot
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
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.