Optimizing over the first Chvátal closure
From MaRDI portal
Publication:877190
DOI10.1007/S10107-006-0054-8zbMATH Open1192.90125OpenAlexW2134946135MaRDI QIDQ877190FDOQ877190
Authors: Matteo Fischetti, Andrea Lodi 
Publication date: 19 April 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0054-8
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
- Title not available (Why is that?)
- Outline of an algorithm for integer solutions to linear programs
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- Integer Programming and Combinatorial Optimization
- Title not available (Why is that?)
- Optimizing over the split closure
- Edmonds polytopes and a hierarchy of combinatorial problems
- Odd Minimum Cut-Sets and b-Matchings
- On the membership problem for the elementary closure of a polyhedron
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- On the separation of split cuts and related inequalities
- On the MIR Closure of Polyhedra
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
- Optimizing over the First Chvàtal Closure
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
Cited In (50)
- On a generalization of the Chvátal-Gomory closure
- On the separation of disjunctive cuts
- Lift-and-project cuts for convex mixed integer nonlinear programs
- How to select a small set of diverse solutions to mixed integer programming problems
- Integer programming techniques for the nurse rostering problem
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- Chvátal-Gomory cuts for the Steiner tree problem
- A lexicographic pricer for the fractional bin packing problem
- Virtual private network design over the first Chvátal closure
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Extended formulation for hop constrained distribution network configuration problems
- On disks of the triangular grid: an application of optimization theory in discrete geometry
- Theoretical challenges towards cutting-plane selection
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Preprocessing and cutting planes with conflict graphs
- Periodic event scheduling for automated production systems
- MIP reformulations of the probabilistic set covering problem
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- On the Chvátal-Gomory closure of a compact convex set
- On the enumerative nature of Gomory's dual cutting plane method
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
- When the Gomory-chvátal closure coincides with the integer hull
- Limited memory rank-1 cuts for vehicle routing problems
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- 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
- Computational approaches for zero forcing and related problems
- 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
- Facet generating techniques
- Split cuts from sparse disjunctions
- On the exact separation of mixed integer knapsack cuts
- Using symmetry to optimize over the Sherali-Adams relaxation
- Computational experience with general cutting planes for the set covering problem
- The cutting plane method is polynomial for perfect matchings
- A relax-and-cut framework for Gomory mixed-integer cuts
- Automatic integer programming reformulation using variable neighborhood search
- MIR closures of polyhedral sets
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Integer programming techniques for educational timetabling
- On the Chvátal-Gomory closure of a compact convex set
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- 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
- Continuous cutting plane algorithms in integer programming
- Coordinated cutting plane generation via multi-objective separation
- Optimizing over the First Chvàtal Closure
- Strengthening Chvátal-Gomory cuts for the stable set problem
Uses Software
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)
