Pages that link to "Item:Q1316588"

The following pages link to A fast algorithm for the maximum weight clique problem (Q1316588):

Displaying 16 items.

• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• Breakout local search for maximum clique problems (Q339563) (← links)
• On risk-averse maximum weighted subgraph problems (Q405680) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
• Cliques and clustering: A combinatorial approach (Q1267180) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
• A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
• A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
• On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
• Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
• Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
• Safe Lower Bounds for Graph Coloring (Q3009768) (← links)