Pages that link to "Item:Q1009183"
From MaRDI portal
The following pages link to Approximating the maximum vertex/edge weighted clique using local search (Q1009183):
Displaying 28 items.
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Breakout local search for maximum clique problems (Q339563) (← links)
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers (Q1015327) (← links)
- Reactive and dynamic local search for max-clique: engineering effective building blocks (Q1038292) (← links)
- Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs (Q1652526) (← links)
- A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← 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)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- (Q3623999) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph (Q5237062) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
- Complexity and heuristics for the weighted max cut‐clique problem (Q6091425) (← links)
- Exact and heuristic solution approaches for the generalized independent set problem (Q6551177) (← links)