Logic-based Benders decomposition
Data up to Jan 2025
Total Citations Per Year
Abstract
References (48)
A Machine-Oriented Logic Based on the Resolution Principle
1965 • 3,880 citations
Partitioning procedures for solving mixed-variables programming problems
1962 • 3,587 citations
Generalized Benders decomposition
1972 • 2,352 citations
Foundations of Constraint Satisfaction
1993 • 1,669 citations
The Problem of Simplifying Truth Functions
1952 • 795 citations
A Way to Simplify Truth Functions
1955 • 575 citations
The OPL Optimization Programming Language
2000 • 519 citations
The Problem of Simplifying Truth Functions
1952 • 431 citations
Testing heuristics: We have it all wrong
1995 • 412 citations
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
2001 • 396 citations
A Way to Simplify Truth Functions
1955 • 322 citations
Logic-based methods for optimization: combining optimization and constraint satisfaction
2001 • 309 citations
Logic‐Based Methods for Optimization
2000 • 280 citations
A Machine-Oriented Logic Based on the Resolution Principle
1965 • 222 citations
Sensitivity theorems in integer linear programming
1986 • 204 citations
Needed: An Empirical Science of Algorithms
1994 • 200 citations
Integer programming duality: Price functions and sensitivity analysis
1981 • 153 citations
Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming
2001 • 145 citations
The value function of an integer program
1982 • 141 citations
Optimization Methods for Logical Inference
2000 • 123 citations
The value function of a mixed integer program: I
1977 • 122 citations
Using duality to solve discrete optimization problems: Theory and computational experience
1975 • 122 citations
Solving the incremental satisfiability problem
1993 • 93 citations
Resolution vs. cutting plane solution of inference problems: Some computational experience
1988 • 80 citations
An elementary survey of general duality theory in mathematical programming
1981 • 76 citations
Constructive Duality in Integer Programming
1974 • 74 citations
Generalized Lagrange Multipliers in Integer Programming
1971 • 74 citations
A scheme for unifying optimization and constraint satisfaction methods
2000 • 64 citations
Recognizing disguised NR(1) instances of the satisfiability problem
1980 • 64 citations
Branch-and-cut solution of inference problems in propositional logic
1990 • 64 citations
Sensitivity Analysis for Branch and Bound Integer Programming
1985 • 61 citations
The b-hull of an integer program
1981 • 55 citations
Logic-based methods for optimization
1994 • 55 citations
Generalized resolution for 0?1 linear inequalities
1992 • 54 citations
A Convergent Duality Theory for Integer Programming
1977 • 48 citations
Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
2000 • 48 citations
Input Proofs and Rank One Cutting Planes
1989 • 37 citations
DUALITY IN DISCRETE PROGRAMMING
2015 • 36 citations
Duality in mathematics and linear and integer programming
1996 • 35 citations
On renamable Horn and generalized Horn functions
1990 • 34 citations
A resource decomposition algorithm for general mathematical programs
1981 • 31 citations
Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
1989 • 27 citations
A Computational Study of Satisfiability Algorithms for Propositional Logic
1994 • 26 citations
Nogood backmarking with min-conflict repair in constraint satisfaction and optimization
1994 • 22 citations
Detecting embedded Horn structure in propositional logic
1992 • 18 citations
BRANCH-AND-CUT SOLUTION OF INFERENCE PROBLEMS IN PROPOSITIONAL LOGIC
1989 • 15 citations
Minimal Inequalities and Subadditive Duality
1980 • 13 citations
GAINFREE LEONTIEF FLOW PROBLEMS
1989 • 8 citations