Equivalence between intersection cuts and the corner polyhedron-Reference-Cited by-同舟云学术

Equivalence between intersection cuts and the corner polyhedron

Published:2010-05 Issue:3 Volume:38 Page:153-155
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Conforti Michele,Cornuéjols Gérard,Zambelli Giacomo

Funder

National Science Foundation

Office of Naval Research

Fondazione Cassa di Risparmio di Padova e Rovigo

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference10 articles.

1. Split closure and intersection cuts;Andersen;Mathematical Programming, Series A,2005

2. Intersection cuts—A new type of cutting planes for integer programming;Balas;Operations Research,1971

3. A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, A counterexample to a conjecture of Gomory and Johnson, manuscript, 2008 (Mathematical Programming, Series A, in press).

4. Minimal valid inequalities for integer constraints;Borozan;Mathematics of Operations Research,2009

5. Chvátal closures for mixed integer programming problems;Cook;Mathematical Programming, Series A,1990

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Outer-product-free sets for polynomial optimization and oracle-based cuts;Mathematical Programming;2020-02-28

2. The Structure of the Infinite Models in Integer Programming;Mathematics of Operations Research;2019-11

3. Cuts from General Disjunctions;Disjunctive Programming;2018

4. A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs;Operations Research;2017-12

5. Intersection cuts for convex mixed integer programs from translated cones;Discrete Optimization;2017-05