Technical Note—A Note on Gomory Fractional Cuts
نویسندگان
چکیده
منابع مشابه
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
Chvátal-Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods for strengthening them are known, for example based on subadditive functions or disjunctive techniques. We present a new and surprisingly simple strengthening procedure, discuss its properties, and present some computational results.
متن کاملGomory cuts revisited
In this paper, we investigate the use of Gomory's mixed integer cuts within a branch-and-cut framework. It has been argued in the literature that \a marriage of classical cutting planes and tree search is out of the question as far as the solution of large-scale combinatorial optimization problems is concerned" 16] because the cuts generated at one node of the search tree need not be valid at o...
متن کاملOn degenerate multi-row Gomory cuts
Borozan and Cornuéjols introduced a semi-infinite relaxation for mixed-integer linear programs, derived from the simplex tableau relative to a fractional vertex f of the linear relaxation. They showed that any minimal valid inequality for such relaxation is determined by a maximal lattice-free convex set containing f . In this note we show that, for the purpose of generating cuts for the origin...
متن کاملTotally tight Chvátal-Gomory cuts
Let P := {x∈Rn: Ax6 b} be a polyhedron and PI its integral hull. A Chv atal–Gomory (CG) cut is a valid inequality for PI of the form ( A)x6 b , with ∈R+; TA∈ Z and b ∈ Z . We give a polynomial-time algorithm which, given some x∗ ∈P, detects whether a totally tight CG cut exists, i.e., whether there is a CG cut such that ( TA)x∗= b. Such a CG cut is violated by as much as possible under the assu...
متن کاملNumerically Safe Gomory Mixed-Integer Cuts
W describe a simple process for generating numerically safe cutting planes using floating-point arithmetic and the mixed-integer rounding procedure. Applying this method to the rows of the simplex tableau permits the generation of Gomory mixed-integer cuts that are guaranteed to be satisfied by all feasible solutions to a mixed-integer programming problem (MIP). We report on tests with the MIPL...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1971
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.19.6.1538