Fenchel Cutting Planes for Integer Programs
From MaRDI portal
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
(65)- A finitely converging cutting plane technique
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Cutting planes for integer programs with general integer variables
- Cutting planes for mixed-integer knapsack polyhedra
- Solving \(0/1\) integer programs with enumeration cutting planes
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cutting planes from a mixed integer Farkas lemma.
- How to extend the concept of convexity cuts to derive deeper 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
- Strong bounds with cut and column generation for class-teacher timetabling
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Fenchel decomposition for stochastic mixed-integer programming
- A simple finite cutting plane algorithm for integer programs
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Strong IP formulations need large coefficients
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Design and verify: a new scheme for generating cutting-planes
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- A cutting plane method for knapsack polytope
- Local cuts for mixed-integer programming
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Separation algorithms for 0-1 knapsack polytopes
- Integer set reduction for stochastic mixed-integer programming
- Selection criteria of export equation on the cutting plane method resolving ILP problems
- Integer programming techniques for the nurse rostering problem
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- 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
- Mathematical models and search algorithms for the capacitated p-center problem
- scientific article; zbMATH DE number 3982913 (Why is no real title available?)
- scientific article; zbMATH DE number 1263271 (Why is no real title available?)
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- scientific article; zbMATH DE number 710403 (Why is no real title available?)
- Reflections on generating (disjunctive) cuts
- Solving capacitated facility location problems by Fenchel cutting planes
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- A Facet Generation Procedure for Solving 0/1 Integer Programs
- On the complexity of inverse mixed integer linear optimization
- Using projected cutting planes in the extended cutting plane method
- Split cuts in the plane
- Projective cutting-planes
- Computational Integer Programming and Cutting Planes
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis
- On the exact separation of mixed integer knapsack cuts
- Branch and cut methods for network optimization
- Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design
- On the enumerative nature of Gomory's dual cutting plane method
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- Vehicle routing problem with time windows -- new valid inequalities from polar duality
- On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
- Computational aspects of lifted cover inequalities for knapsacks with few different weights
- An application of the Hermite normal form in integer programming
- Knapsack polytopes: a survey
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- A computational study of exact knapsack separation for the generalized assignment problem
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)
