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 25 items.

• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
• An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
• A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
• A new upper bound for the maximum weight clique problem (Q1754725) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← 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)
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← 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)
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
• Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
• A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
• A new trust region technique for the maximum weight clique problem (Q2433799) (← 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)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← 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)
• A New Branch and Bound Algorithm for the Clique Partitioning Problem (Q5392092) (← links)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)