An application of tabu search heuristic for the maximum edge-weighted subgraph problem
From MaRDI portal
Publication:1861927
DOI10.1023/A:1021525624027zbMath1028.90041OpenAlexW13877772MaRDI QIDQ1861927
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021525624027
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
A review on algorithms for maximum clique problems ⋮ Iterated tabu search for the maximum diversity problem ⋮ Breakout local search for maximum clique problems ⋮ Solving the maximum edge weight clique problem via unconstrained quadratic programming ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ Dispersion with connectivity in wireless mesh networks ⋮ Iterated greedy for the maximum diversity problem ⋮ Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles ⋮ Approximating the maximum vertex/edge weighted clique using local search ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ On solving the densestk-subgraph problem on large graphs ⋮ A hybrid metaheuristic method for the maximum diversity problem
This page was built for publication: An application of tabu search heuristic for the maximum edge-weighted subgraph problem
