Pages that link to "Item:Q1328431"

The following pages link to An exact algorithm for the maximum stable set problem (Q1328431):

Displaying 32 items.

• Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
• Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
• Computational study of large-scale \(p\)-median problems (Q868446) (← links)
• A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
• The 0-1 inverse maximum stable set problem (Q955316) (← links)
• STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
• A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
• An exact algorithm for the maximum stable set problem (Q1328431) (← links)
• The struction algorithm for the maximum stable set problem revisited (Q1332429) (← links)
• A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
• The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
• An augmentation algorithm for the maximum weighted stable set problem (Q1819158) (← links)
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
• Solving hard set covering problems (Q1924619) (← links)
• A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
• Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
• The stable set problem and the thinness of a graph (Q2643810) (← links)
• Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530) (← links)
• Reductions for the stable set problem (Q2865866) (← links)
• A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems (Q2883604) (← links)
• Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem (Q3392126) (← links)
• (Q3751618) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
• A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)
• Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
• Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
• Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)