Optimizing over the first Chvátal closure

DOI10.1007/s10107-006-0054-8zbMath1192.90125OpenAlexW2134946135MaRDI QIDQ877190

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

zbMATH Keywords

Computational analysis Chvátal-Gomory cuts Integer programs Separation problems

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Integer programming techniques for the nurse rostering problem, How to select a small set of diverse solutions to mixed integer programming problems, Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, Computational approaches for zero forcing and related problems, MIP reformulations of the probabilistic set covering problem, MIR closures of polyhedral sets, A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Theoretical challenges towards cutting-plane selection, Lifted and local reachability cuts for the vehicle routing problem with time windows, Improved bounds for large scale capacitated arc routing problem, A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution, On optimizing over lift-and-project closures, Chvátal-Gomory cuts for the Steiner tree problem, Periodic Event Scheduling for Automated Production Systems, On the enumerative nature of Gomory's dual cutting plane method, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Extended formulation for hop constrained distribution network configuration problems, On disks of the triangular grid: an application of optimization theory in discrete geometry, When the Gomory-chvátal closure coincides with the integer hull, Continuous cutting plane algorithms in integer programming, On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube, Automatic integer programming reformulation using variable neighborhood search, A heuristic to generate rank-1 GMI cuts, Split cuts from sparse disjunctions, Outer-product-free sets for polynomial optimization and oracle-based cuts, Lift-and-project cuts for convex mixed integer nonlinear programs, Facet Generating Techniques, Coordinated cutting plane generation via multi-objective separation, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, Limited memory rank-1 cuts for vehicle routing problems, Using symmetry to optimize over the Sherali-Adams relaxation, On the Chvátal-Gomory Closure of a Compact Convex Set, On the Chvátal-Gomory closure of a compact convex set, Integer programming techniques for educational timetabling, A relax-and-cut framework for Gomory mixed-integer cuts, On the exact separation of mixed integer knapsack cuts, On the separation of disjunctive cuts, Preprocessing and cutting planes with conflict graphs, Aggregation-based cutting-planes for packing and covering integer programs, A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set, The Cutting Plane Method is Polynomial for Perfect Matchings, Computational experience with general cutting planes for the set covering problem, A lexicographic pricer for the fractional bin packing problem, Strengthening Chvátal-Gomory Cuts for the Stable Set Problem, Virtual private network design over the first Chvátal closure, Strong bounds for resource constrained project scheduling: preprocessing and cutting planes, On a generalization of the Chvátal-Gomory closure

Uses Software

Cites Work