Polyhedral convexity cuts and negative edge extensions
From MaRDI portal
Publication:4777060
DOI10.1007/BF02026599zbMath0288.90056MaRDI QIDQ4777060
Publication date: 1974
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
90C10: Integer programming
Related Items
A finite cutting plane method for solving linear programs with an additional reverse convex constraint, A finite procedure to generate feasible points for the extreme point mathematical programming problem, A finitely convergent procedure for facial disjunctive programs, Enhanced intersection cutting-plane approach for linear complementarity problems, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Facet inequalities from simple disjunctions in cutting plane theory, Optimization of linear-convex programs, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Polyhedral annexation in mixed integer and combinatorial programming
Cites Work