On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
From MaRDI portal
Publication:4838962
DOI10.1137/0805021zbMATH Open0834.90095OpenAlexW1990146579MaRDI QIDQ4838962FDOQ4838962
Authors: 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
Recommendations
- Fenchel Cutting Planes for Integer Programs
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- scientific article; zbMATH DE number 710403
- Fenchel decomposition for stochastic mixed-integer programming
Cited In (15)
- Fenchel Cutting Planes for Integer Programs
- A cutting plane method for knapsack polytope
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A finitely converging cutting plane technique
- Target cuts from relaxed decision diagrams
- Integer set reduction for stochastic mixed-integer programming
- Cutting planes for mixed-integer knapsack polyhedra
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- 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
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- A computational study of exact knapsack separation for the generalized assignment problem
- Fenchel decomposition for stochastic mixed-integer programming
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
This page was built for publication: On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838962)
