Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

Authors:
A. Grosso;M. Locatelli;F. Della Croce
Affiliations:
D.I., Università di Torino, Torino,Italy. grosso@di.unito.it;D.I., Università di Torino, Torino,Italy. locatell@di.unito.it;D.A.I., Politecnico di Torino, Torino, Italy. federico.dellacroce@polito.it
Venue:
Journal of Heuristics
Year:
2004

Citing 6
Cited 7

Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP

ACM Transactions on Mathematical Software (TOMS)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique

Journal of Heuristics
A fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
An algorithm for finding a maximum clique in a graph

Operations Research Letters

A study of ACO capabilities for solving the maximum clique problem

Journal of Heuristics
A leader-based parallel cross entropy algorithm for MCP

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Simple ingredients leading to very efficient heuristics for the maximum clique problem

Journal of Heuristics
Dynamic local search for the maximum clique problem

Journal of Artificial Intelligence Research
Fast local search for the maximum independent set problem

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Cooperating local search for the maximum clique problem

Journal of Heuristics
Local search with edge weighting and configuration checking heuristics for minimum vertex cover

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ore selection problem involves choosing a processing option for a number of mining blocks that maximises the expected payoff for a given level of financial risk. An innovative neighbourhood search heuristic is proposed for the ore selection problem. ...