Integer and combinatorial optimization
Integer and combinatorial optimization
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
On a certain class of nonideal clutters
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality"
Discrete Applied Mathematics - Special issue: Max-algebra
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Note: On the behavior of the N+-operator under blocker duality
Discrete Applied Mathematics
Lift-and-project ranks and antiblocker duality
Operations Research Letters
| Hi-index | 0.04 |
In this paper we relate two rather different branches of polyhedral theory in linear optimization problems: the blocking type polyhedra and the disjunctive procedure of Balas et al. For this purpose, we define a disjunctive procedure over blocking type polyhedra with vertices in [0, 1]n, study its properties, and analyze its behavior under blocker duality. We compare the indices of the procedure over a pair of blocking clutter polyhedra, obtaining that they coincide.