Pages that link to "Item:Q2424766"

The following pages link to A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766):

Displaying 12 items.

• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← 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)
• \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
• LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
• BDD-based optimization for the quadratic stable set problem (Q2673237) (← links)
• Total coloring and total matching: polyhedra and facets (Q2673562) (← 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)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)