Fenchel Cutting Planes for Integer Programs
From MaRDI portal
Publication:4287599
DOI10.1287/OPRE.42.1.53zbMATH Open0809.90104OpenAlexW2003264207MaRDI QIDQ4287599FDOQ4287599
Authors: E. Andrew Boyd 
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
Recommendations
- scientific article; zbMATH DE number 1263271
- scientific article; zbMATH DE number 710403
- Cutting planes for integer programs with general integer variables
- Cutting planes in integer and mixed integer programming
- Computational Integer Programming and Cutting Planes
- A simple finite cutting plane algorithm for integer programs
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- Continuous cutting plane algorithms in integer programming
- Cutting planes cannot approximate some integer programs
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Cited In (57)
- Title not available (Why is that?)
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Using projected cutting planes in the extended cutting plane method
- A cutting plane method for knapsack polytope
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A simple finite cutting plane algorithm for integer programs
- An application of the Hermite normal form in integer programming
- Knapsack polytopes: a survey
- A finitely converging cutting plane technique
- Integer programming techniques for the nurse rostering problem
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- Integer set reduction for stochastic mixed-integer programming
- Strong IP formulations need large coefficients
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Cutting planes for mixed-integer knapsack polyhedra
- Local cuts for mixed-integer programming
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Design and verify: A new scheme for generating cutting-planes
- Cutting planes from a mixed integer Farkas lemma.
- Solving \(0/1\) integer programs with enumeration cutting planes
- On the enumerative nature of Gomory's dual cutting plane method
- Projective cutting-planes
- Solving capacitated facility location problems by Fenchel cutting planes
- Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- Reflections on generating (disjunctive) cuts
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- Strong bounds with cut and column generation for class-teacher timetabling
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Design and verify: a new scheme for generating cutting-planes
- An implementation of exact knapsack separation
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
- Split cuts in the plane
- Separation algorithms for 0-1 knapsack polytopes
- Selection criteria of export equation on the cutting plane method resolving ILP problems
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- On the exact separation of mixed integer knapsack cuts
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- On the complexity of inverse mixed integer linear optimization
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Branch and cut methods for network optimization
- A computational study of exact knapsack separation for the generalized assignment problem
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- A column generation approach to high school timetabling modeled as a multicommodity flow problem
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Fenchel decomposition for stochastic mixed-integer programming
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Title not available (Why is that?)
- Computational Integer Programming and Cutting Planes
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
This page was built for publication: Fenchel Cutting Planes for Integer Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287599)
