On the membership problem for the elementary closure of a polyhedron

From MaRDI portal
Publication:1125619

DOI10.1007/s004930050057zbMath0947.90071OpenAlexW2017095313MaRDI QIDQ1125619

Friedrich Eisenbrand

Publication date: 8 December 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050057



Related Items

MIPping closures: An instant survey, MIR closures of polyhedral sets, Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point, A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution, On optimizing over lift-and-project closures, Optimizing over the first Chvátal closure, On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure, When the Gomory-chvátal closure coincides with the integer hull, On the membership problem for the \({0, 1/2}\)-closure, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, A knapsack intersection hierarchy, Facet Generating Techniques, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, Strengthening convex relaxations of 0/1-sets using Boolean formulas, Rank bounds for a hierarchy of Lovász and Schrijver, The stable set polytope of quasi-line graphs, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Metric inequalities and the network loading problem, Projected Chvátal-Gomory cuts for mixed integer linear programs, Elementary closures for integer programs., Chvatal--Gomory--tier cuts for general integer programs, Valid inequalities for mixed integer linear programs, On the rational polytopes with Chvátal rank 1, Approximate fixed-rank closures of covering problems, Totally tight Chvatal-Gomory cuts, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts