Experimental and Efficient Algorithms
From MaRDI portal
Publication:5710057
DOI10.1007/b136461zbMath1121.68417OpenAlexW2485841483MaRDI QIDQ5710057
Alexandre Plastino, Paulo M. F. de Andrade, Marcos R. Q. de Andrade, Simone L. Martins
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (9)
A review on algorithms for maximum clique problems ⋮ A branch and bound algorithm for the maximum diversity problem ⋮ A simple and effective algorithm for the MaxMin diversity problem ⋮ Tabu search versus GRASP for the maximum diversity problem ⋮ TTT plots: a perl program to create time-to-target plots ⋮ A nonconvex quadratic optimization approach to the maximum edge weight clique problem ⋮ Iterated greedy for the maximum diversity problem ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ A hybrid metaheuristic method for the maximum diversity problem
This page was built for publication: Experimental and Efficient Algorithms