Pages that link to "Item:Q2260912"
From MaRDI portal
The following pages link to Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912):
Displayed 9 items.
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← 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)
- 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)
- Complexity and heuristics for the weighted max cut‐clique problem (Q6091425) (← links)