Generating Fenchel Cutting Planes for Knapsack Polyhedra
From MaRDI portal
Publication:4277510
DOI10.1137/0803038zbMath0797.90067OpenAlexW2163936975MaRDI QIDQ4277510
Publication date: 25 October 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0803038
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Boolean programming (90C09)
Related Items
Knapsack polytopes: a survey ⋮ Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ Solving \(0/1\) integer programs with enumeration cutting planes ⋮ Computing deep facet-defining disjunctive cuts for mixed-integer programming ⋮ Separation algorithms for 0-1 knapsack polytopes ⋮ 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 ⋮ Local cuts for mixed-integer programming ⋮ Lifting the knapsack cover inequalities for the knapsack polytope ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes ⋮ Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ 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 ⋮ The strength of multi-row models ⋮ Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ Cutting planes for mixed-integer knapsack polyhedra
Uses Software
