Pages that link to "Item:Q1411614"
From MaRDI portal
The following pages link to On the separation of split cuts and related inequalities (Q1411614):
Displaying 39 items.
- Bilevel programming and the separation problem (Q403662) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Split cuts for robust mixed-integer optimization (Q439905) (← 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)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466) (← links)
- The complexity of cover inequality separation (Q1306471) (← links)
- Primal separation algorithms (Q1416099) (← links)
- Binary clutter inequalities for integer programs (Q1424294) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- On the separation of maximally violated mod-\(k\) cuts (Q1970294) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- A constructive characterization of the split closure of a mixed integer linear program (Q2643814) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- (Q3090134) (← links)
- (Q4737523) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
