On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming

DOI10.1137/0805021zbMath0834.90095OpenAlexW1990146579MaRDI QIDQ4838962

E. Andrew Boyd

Publication date: 13 July 1995

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0805021

zbMATH Keywords

Fenchel cutting planes

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Related Items (12)

Computing deep facet-defining disjunctive cuts for mixed-integer programming ⋮ An implementation of exact knapsack separation ⋮ Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure ⋮ A cutting plane method for knapsack polytope ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes ⋮ A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ Cutting planes for mixed-integer knapsack polyhedra

This page was built for publication: On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming