The following pages link to (Q5687247):
Displaying 23 items.
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← 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)
- (Q3112179) (← links)
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques (Q3294898) (← links)
- On graphs with polynomially solvable maximum-weight clique problem (Q3809822) (← links)
- Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- A set packing model for the ground holding problem in congested networks (Q5935422) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)