Fenchel Cutting Planes for Integer Programs
From MaRDI portal
Publication:4287599
DOI10.1287/opre.42.1.53zbMath0809.90104OpenAlexW2003264207MaRDI QIDQ4287599
Publication date: 12 April 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.42.1.53
Related Items (36)
Knapsack polytopes: a survey ⋮ Integer programming techniques for the nurse rostering problem ⋮ 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 ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ A solution algorithm for chance-constrained problems with integer second-stage recourse decisions ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ Reflections on generating (disjunctive) cuts ⋮ Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes ⋮ Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem ⋮ A column generation approach to high school timetabling modeled as a multicommodity flow problem ⋮ A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes ⋮ Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis ⋮ Strong bounds with cut and column generation for class-teacher timetabling ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ On the exact separation of mixed integer knapsack cuts ⋮ Branch and cut methods for network optimization ⋮ Strong IP formulations need large coefficients ⋮ Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ Cutting planes for mixed-integer knapsack polyhedra ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective ⋮ On the Complexity of Inverse Mixed Integer Linear Optimization
This page was built for publication: Fenchel Cutting Planes for Integer Programs
