Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (12)
Disjunctive Programming
1979 • 434 citations
Disjunctive programming: Properties of the convex hull of feasible points
1998 • 434 citations
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
1969 • 384 citations
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
1980 • 291 citations
Modelling with integer variables
1984 • 165 citations
Strengthening cuts for mixed integer programs
1980 • 123 citations
Sequencing by enumerative methods
1977 • 117 citations
Optimization with Disjunctive Constraints
1980 • 104 citations
The perfectly matchable subgraph polytope of a bipartite graph
1983 • 103 citations
Cutting-Plane Theory: Disjunctive Methods
1977 • 80 citations
Cutting planes from conditional bounds: A new approach to set covering
1980 • 51 citations
Facial disjunctive programs and sequence of cutting-planes
1980 • 17 citations