Pages that link to "Item:Q5940036"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036):
Displaying 31 items.
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
- 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)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- Analysis of a generalized linear ordering problem via integer programming (Q2009010) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← 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)
- A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems (Q2883604) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- Optimization Bounds from Binary Decision Diagrams (Q2962554) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← 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)
- A set packing model for the ground holding problem in congested networks (Q5935422) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
- Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)
