Solving the maximum vertex weight clique problem via binary quadratic programming
From MaRDI portal
(Redirected from Publication:306100)
Recommendations
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Multi-neighborhood tabu search for the maximum weight clique problem
- PUSH: A generalized operator for the maximum vertex weight clique problem
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- Less is more: tabu search for Bipartite Qudratic Programming problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- A branch and bound algorithm for the maximum clique problem
- A branch and cut solver for the maximum stable set problem
- A fast algorithm for the maximum clique problem
- A fast algorithm for the maximum weight clique problem
- A new approach for modeling and solving set packing problems
- A new modeling and solution approach for the set-partitioning problem
- A new trust region technique for the maximum weight clique problem
- A quasi-human algorithm for solving the three-dimensional rectangular packing problem
- A review on algorithms for maximum clique problems
- A tutorial on branch and cut algorithms for the maximum stable set problem
- A unified modeling and solution framework for combinatorial optimization problems
- An augmentation algorithm for the maximum weighted stable set problem
- An effective modeling and solution approach for the generalized independent set problem
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- An improved branch and bound algorithm for the maximum clique problem
- Approximating the maximum vertex/edge weighted clique using local search
- Breakout local search for the quadratic assignment problem
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
- Introduction to global optimization
- Multi-neighborhood tabu search for the maximum weight clique problem
- Multi-threading a state-of-the-art maximum clique algorithm
- On characterization of maximal independent sets via quadratic optimization
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Tabu Search—Part I
- The unconstrained binary quadratic programming problem: a survey
- Variable neighborhood search: Principles and applications
Cited in
(7)- PUSH: A generalized operator for the maximum vertex weight clique problem
- Less is more: tabu search for Bipartite Qudratic Programming problem
- Clustered maximum weight clique problem: algorithms and empirical analysis
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
This page was built for publication: Solving the maximum vertex weight clique problem via binary quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306100)
