On the public citation graph
Generalized resolution for 0?1 linear inequalities
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.1007/bf01585527openalex-snapshot
Coefficient reduction for inequalities in 0–1 variables
inferredcites →https://doi.org/10.1007/bf02186368openalex-snapshot
Generalized resolution and cutting planes
inferredcites →https://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferredcites →https://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot
A quantitative approach to logical inference
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/c2009-0-27551-9openalex-snapshot
Logical Foundations of Artificial Intelligence
inferredcites →https://doi.org/10.1080/00029890.1952.11988183openalex-snapshot
The Problem of Simplifying Truth Functions
inferredcites →https://doi.org/10.1080/00029890.1955.11988710openalex-snapshot
A Way to Simplify Truth Functions
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/ijoc.1.3.137openalex-snapshot
Input Proofs and Rank One Cutting Planes
inferredcites →https://doi.org/10.1287/opre.29.1.49openalex-snapshot
Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
inferredcites →https://doi.org/10.1287/opre.33.4.803openalex-snapshot
Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118033036.ch19openalex-snapshot
Logic‐Based Benders Decomposition
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_217openalex-snapshot
Decomposition techniques for MILP: Lagrangian relaxation; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming: Lagrangian…
inferred← citeshttps://doi.org/10.1007/10720084_1openalex-snapshot
Combining Logic and Optimization in Cutting Plane Theory
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_40openalex-snapshot
Linear 0–1 inequalities and extended clauses
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_2openalex-snapshot
Solving pseudo-Boolean constraints
inferred← citeshttps://doi.org/10.1007/3-540-61551-2_77openalex-snapshot
Inference duality as a basis for sensitivity analysis
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_289openalex-snapshot
Integer Programming Duality
inferred← citeshttps://doi.org/10.1007/978-1-4615-1043-7_1openalex-snapshot
A Framework for Integrating Solution Methods
inferred← citeshttps://doi.org/10.1007/978-1-4757-2807-1_1openalex-snapshot
Constraint Satisfaction Methods for Generating Valid Cuts
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_289-1openalex-snapshot
Integer Programming Duality
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_15openalex-snapshot
Non-clausal Redundancy Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_19openalex-snapshot
Automatic Rollback Suggestions for Incremental Datalog Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_18openalex-snapshot
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_21openalex-snapshot
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-46955-8_7openalex-snapshot
Linear 0-1 Inequalities and Extended Clauses
inferred← citeshttps://doi.org/10.1007/bf01530787openalex-snapshot
Many-valued logic and mixed integer programming
inferred← citeshttps://doi.org/10.1007/bfb0016842openalex-snapshot
Simplifying clausal satisfiability problems
inferred← citeshttps://doi.org/10.1007/bfb0023767openalex-snapshot
Logical inference and polyhedral projection
inferred← citeshttps://doi.org/10.1007/s10107-003-0375-9openalex-snapshot
Logic-based Benders decomposition
inferred← citeshttps://doi.org/10.1007/s10107-022-01778-8openalex-snapshot
Achieving consistency with cutting planes
inferred← citeshttps://doi.org/10.1007/s10479-009-0623-3openalex-snapshot
Projecting systems of linear inequalities with binary variables
inferred← citeshttps://doi.org/10.1007/s10601-015-9201-2openalex-snapshot
Projection, consistency, and George Boole
inferred← citeshttps://doi.org/10.1007/s10601-020-09318-xopenalex-snapshot
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
inferred← citeshttps://doi.org/10.1007/s12597-019-00378-zopenalex-snapshot
A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90089-2openalex-snapshot
Logic cuts for processing networks with fixed charges
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00100-6openalex-snapshot
Mixed logical-linear programming
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00576-3openalex-snapshot
Logic cuts for multilevel generalized assignment problems
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80019-2openalex-snapshot
Operations Research Methods in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/s0269888900001090openalex-snapshot
Artificial intelligence and operations research: challenges and opportunities in planning and scheduling
inferred← citeshttps://doi.org/10.1017/s147106842500002xopenalex-snapshot
Provenance Guided Rollback Suggestions
inferred← citeshttps://doi.org/10.1023/a:1009838725226openalex-snapshot
Inference Duality as a Basis for Sensitivity Analysis
inferred← citeshttps://doi.org/10.1023/a:1018904229454openalex-snapshot
A new approach to integrating mixed integer programming and constraint logicprogramming
inferred← citeshttps://doi.org/10.1109/access.2021.3120597openalex-snapshot
Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving
inferred← citeshttps://doi.org/10.1109/tcad.2004.842808openalex-snapshot
A fast pseudo-Boolean constraint solver
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.295.2828openalex-snapshot
Logic, Optimization, and Constraint Programming
inferred← citeshttps://doi.org/10.1287/opre.48.4.623.12420openalex-snapshot
Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
inferred← citeshttps://doi.org/10.1287/opre.49.1.42.11196openalex-snapshot
Optimal Design of Truss Structures by Logic-Based Branch and Cut
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5508openalex-snapshot
A Cardinal Improvement to Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.24963/ijcai.2018/180openalex-snapshot
Divide and Conquer: Towards Faster Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.24963/ijcai.2019/237openalex-snapshot
On Division Versus Saturation in Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.3233/faia230387openalex-snapshot
Oracle-Based Local Search for Pseudo-Boolean Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13975openalex-snapshot
A Brief Tour of Logic and Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2301.03667openalex-snapshot
Implementations of two Algorithms for the Threshold Synthesis Problem
inferred← citeshttps://doi.org/10.5555/2833227.2833249openalex-snapshot
The space complexity of cutting planes refutations
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.