Pages that link to "Item:Q877190"
From MaRDI portal
The following pages link to Optimizing over the first Chvátal closure (Q877190):
Displaying 49 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints (Q321126) (← links)
- Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Automatic integer programming reformulation using variable neighborhood search (Q1687624) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
- Integer programming techniques for educational timetabling (Q1754009) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- On disks of the triangular grid: an application of optimization theory in discrete geometry (Q2185738) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- On the Chvátal-Gomory closure of a compact convex set (Q2248755) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- On the Chvátal-Gomory Closure of a Compact Convex Set (Q3009756) (← links)
- Periodic Event Scheduling for Automated Production Systems (Q5086025) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- Continuous cutting plane algorithms in integer programming (Q6047699) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
