K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
From MaRDI portal
Publication:2884566
DOI10.1287/ijoc.15.4.385.24893zbMath1238.90105OpenAlexW2160294322MaRDI QIDQ2884566
Cornuéjols, Gérard, Yanjun Li, Dieter Vandenbussche
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.15.4.385.24893
Integer programming (90C10) Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Characterization of the split closure via geometric lifting, Two row mixed-integer cuts via lifting, Theoretical challenges towards cutting-plane selection, Local cuts for mixed-integer programming, Mixed-integer cuts from cyclic groups, A 3-slope theorem for the infinite relaxation in the plane, Exact solutions to linear programming problems, On the strength of Gomory mixed-integer cuts as group cuts, How tight is the corner relaxation?, Lattice Reformulation Cuts, On the exact separation of mixed integer knapsack cuts, Valid inequalities based on the interpolation procedure, Chvatal--Gomory--tier cuts for general integer programs, Valid inequalities for mips and group polyhedra from approximate liftings, Valid inequalities based on simple mixed-integer sets
