Pages that link to "Item:Q877032"

The following pages link to Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032):

Displaying 20 items.

• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
• On fuzzy random multiobjective quadratic programming (Q958074) (← links)
• PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
• Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
• A new approach for modeling and solving set packing problems (Q2462145) (← links)
• On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problem (Q2466102) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization (Q4991677) (← links)
• On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
• Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph (Q5237062) (← links)