Pages that link to "Item:Q491210"

The following pages link to A branch and cut solver for the maximum stable set problem (Q491210):

Displaying 30 items.

• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• A strengthened general cut-generating procedure for the stable set polytope (Q324806) (← links)
• An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
• Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
• An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
• On the Lovász theta function and some variants (Q1751239) (← links)
• General cut-generating procedures for the stable set polytope (Q1752480) (← links)
• Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
• Graph signatures: identification and optimization (Q2242325) (← links)
• Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations (Q2261724) (← links)
• Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
• The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
• Fast separation for the three-index assignment problem (Q2398106) (← 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 Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← 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)
• An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
• Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)