Cutting planes for integer programs with general integer variables
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 429663 (Why is no real title available?)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Gomory cuts revisited
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On the \(0/1\) knapsack polytope
- On the facial structure of set packing polyhedra
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Solving Large-Scale Zero-One Linear Programming Problems
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Cited in
(33)- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Classical cuts for mixed-integer programming and branch-and-cut
- A hybrid approach for biobjective optimization
- A computational comparison of Gomory and knapsack cuts
- Generating cuts in integer programming with families of special ordered sets
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Multistage robust discrete optimization via quantified integer programming
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Cover and pack inequalities for (mixed) integer programming
- Constrained integer fractional programming problem with box constraints
- On the redundancy of cutting planes for linear complementarity problems
- Computational Integer Programming and Cutting Planes
- Solving the facility location and fixed charge solid transportation problem
- Local cuts for mixed-integer programming
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- A polyhedral study of the semi-continuous knapsack problem
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- A framework for constructing general integer problems with well-determined duality gaps
- Fenchel Cutting Planes for Integer Programs
- Cutting planes in integer and mixed integer programming
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Lifting for the integer knapsack cover polyhedron
- Cutting planes for multistage stochastic integer programs
- A surrogate cutting plane algorithm for all-integer programming
- Knapsack polytopes: a survey
- Completeness of cutting planes revisited
This page was built for publication: Cutting planes for integer programs with general integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290616)
