Optimizing over the first Chvátal closure
From MaRDI portal
Recommendations
- Optimizing over the First Chvàtal Closure
- Optimizing over the split closure
- On optimizing over lift-and-project closures
- scientific article; zbMATH DE number 1046151
- Optimization of a Cauchy radius improvement
- Chvátal closures for mixed integer programming problems
- First-order methods in optimization
- scientific article; zbMATH DE number 592622
- Modification of chord method for solving optimization problems
- Variational optimization via chattering
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
- Edmonds polytopes and a hierarchy of combinatorial problems
- Integer Programming and Combinatorial Optimization
- Maximum matching and a polyhedron with 0,1-vertices
- Odd Minimum Cut-Sets and b-Matchings
- On the MIR Closure of Polyhedra
- On the membership problem for the elementary closure of a polyhedron
- On the separation of split cuts and related inequalities
- Optimizing over the First Chvàtal Closure
- Optimizing over the split closure
- Outline of an algorithm for integer solutions to linear programs
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
Cited in
(50)- On disks of the triangular grid: an application of optimization theory in discrete geometry
- How to select a small set of diverse solutions to mixed integer programming problems
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- MIP reformulations of the probabilistic set covering problem
- Virtual private network design over the first Chvátal closure
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- The cutting plane method is polynomial for perfect matchings
- Integer programming techniques for educational timetabling
- A relax-and-cut framework for Gomory mixed-integer cuts
- Split cuts from sparse disjunctions
- Computational approaches for zero forcing and related problems
- Integer programming techniques for the nurse rostering problem
- On a generalization of the Chvátal-Gomory closure
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Automatic integer programming reformulation using variable neighborhood search
- On the Chvátal-Gomory closure of a compact convex set
- Preprocessing and cutting planes with conflict graphs
- Computational experience with general cutting planes for the set covering problem
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- On optimizing over lift-and-project closures
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- Chvátal-Gomory cuts for the Steiner tree problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Optimizing over the First Chvàtal Closure
- On the exact separation of mixed integer knapsack cuts
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- On the separation of disjunctive cuts
- Continuous cutting plane algorithms in integer programming
- On the enumerative nature of Gomory's dual cutting plane method
- On the Chvátal-Gomory closure of a compact convex set
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- When the Gomory-chvátal closure coincides with the integer hull
- Facet generating techniques
- Coordinated cutting plane generation via multi-objective separation
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Extended formulation for hop constrained distribution network configuration problems
- MIR closures of polyhedral sets
- Periodic event scheduling for automated production systems
- A lexicographic pricer for the fractional bin packing problem
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
- Theoretical challenges towards cutting-plane selection
- Using symmetry to optimize over the Sherali-Adams relaxation
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
- Improved bounds for large scale capacitated arc routing problem
- Aggregation-based cutting-planes for packing and covering integer programs
- A heuristic to generate rank-1 GMI cuts
- Strengthening Chvátal-Gomory cuts for the stable set problem
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Limited memory rank-1 cuts for vehicle routing problems
This page was built for publication: Optimizing over the first Chvátal closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877190)
