Pages that link to "Item:Q1756769"
From MaRDI portal
The following pages link to A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769):
Displaying 15 items.
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Algorithms for the generalized independent set problem based on a quadratic optimization approach (Q2329644) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- On a continuous approach for the maximum weighted clique problem (Q2392119) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- Continuous Characterizations of the Maximum Clique Problem (Q4361794) (← 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)
- Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph (Q5237062) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces (Q6648843) (← links)
