Pages that link to "Item:Q1328431"

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

Displaying 15 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)
• Block linear majorants in quadratic 0--1 optimization (Q705499) (← 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)
• A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
• An exact algorithm for the maximum stable set problem (Q1328431) (← links)
• The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← 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)
• Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530) (← links)
• Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
• Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)