Pages that link to "Item:Q378110"
From MaRDI portal
The following pages link to Strong lift-and-project cutting planes for the stable set problem (Q378110):
Displaying 21 items.
- A strengthened general cut-generating procedure for the stable set polytope (Q324806) (← links)
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques (Q2675702) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Symplectic group lattices (Q4235624) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
