Pages that link to "Item:Q2784445"

The following pages link to A Complementary Pivoting Approach to the Maximum Weight Clique Problem (Q2784445):

Displayed 15 items.

• The combinatorics of pivoting for the maximum weight clique. (Q703275) ‎ (← links)
• Graph polynomials from principal pivoting (Q856875) ‎ (← links)
• Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) ‎ (← links)
• A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) ‎ (← links)
• A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) ‎ (← links)
• On independent cliques and linear complementarity problems (Q2095085) ‎ (← links)
• On a continuous approach for the maximum weighted clique problem (Q2392119) ‎ (← links)
• A new trust region technique for the maximum weight clique problem (Q2433799) ‎ (← links)
• A hybrid heuristic for the maximum clique problem (Q2491328) ‎ (← links)
• Quartic formulation of standard quadratic optimization problems (Q2576445) ‎ (← links)
• A review on algorithms for maximum clique problems (Q2630214) ‎ (← links)
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) ‎ (← links)
• Fast Cluster Detection in Networks by First Order Optimization (Q5065475) ‎ (← links)
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) ‎ (← links)
• On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) ‎ (← links)