Pages that link to "Item:Q1754725"

The following pages link to A new upper bound for the maximum weight clique problem (Q1754725):

Displaying 18 items.

• Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
• Maximum dispersion and geometric maximum weight cliques (Q1879248) (← links)
• A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
• Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
• A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
• An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem (Q2800956) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• On graphs with polynomially solvable maximum-weight clique problem (Q3809822) (← links)
• (Q4960830) (← links)
• A Fast Algorithm for Knapsack Problem with Conflict Graph (Q5024916) (← links)
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)