Article

A simple heuristic based genetic algorithm for the maximum clique problem

Author:

Elena MarchioriAuthors Info & Claims

SAC '98: Proceedings of the 1998 ACM symposium on Applied Computing

Pages 366 - 373

https://doi.org/10.1145/330560.330841

Published: 27 February 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Liu XSun JXu Z(2024)Learning to sample initial solution for solving 0–1 discrete optimization problem by local searchScience China Mathematics10.1007/s11425-023-2290-y67:6(1317-1340)Online publication date: 29-Apr-2024
https://doi.org/10.1007/s11425-023-2290-y
Hasan MIslam MMugdha A(2023)Solving maximum clique problem using chemical reaction optimizationOPSEARCH10.1007/s12597-023-00654-z60:3(1230-1266)Online publication date: 20-Jun-2023
https://doi.org/10.1007/s12597-023-00654-z
Gupta SSingh DChoudhary J(2022)A review of clique-based overlapping community detection algorithmsKnowledge and Information Systems10.1007/s10115-022-01704-664:8(2023-2058)Online publication date: 27-Jun-2022
https://doi.org/10.1007/s10115-022-01704-6
Show More Cited By

Index Terms

A simple heuristic based genetic algorithm for the maximum clique problem

Recommendations

Solving the maximum clique problem by k-opt local search
SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and drop moves, each of which can be interpreted as 1-opt move, to search a k-...
Subgraph extraction and metaheuristics for the maximum clique problem

The maximum clique problem involves finding the largest set of pairwise adjacent vertices in a graph. The problem is classic but still attracts much attention because of its hardness and its prominent applications. Our work is based on the existence of ...
An effective local search for the maximum clique problem

We propose a variable depth search based algorithm, called k-opt local search (KLS), for the maximum clique problem. KLS efficiently explores the k-opt neighborhood defined as the set of neighbors that can be obtained by a sequence of several add and ...

Comments

Information & Contributors

Information

Published In

SAC '98: Proceedings of the 1998 ACM symposium on Applied Computing

February 1998

778 pages

ISBN:0897919696

DOI:10.1145/330560

Chairmen:
K. M. George
Oklahoma State Univ.
,
Gary B. Lamong
Air Force Institute of Technology, Dayton, OH

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC98

Sponsor:

SAC98: 1998 ACM Symposium on Applied Computing

February 27 - March 1, 1998

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu XSun JXu Z(2024)Learning to sample initial solution for solving 0–1 discrete optimization problem by local searchScience China Mathematics10.1007/s11425-023-2290-y67:6(1317-1340)Online publication date: 29-Apr-2024
https://doi.org/10.1007/s11425-023-2290-y
Hasan MIslam MMugdha A(2023)Solving maximum clique problem using chemical reaction optimizationOPSEARCH10.1007/s12597-023-00654-z60:3(1230-1266)Online publication date: 20-Jun-2023
https://doi.org/10.1007/s12597-023-00654-z
Gupta SSingh DChoudhary J(2022)A review of clique-based overlapping community detection algorithmsKnowledge and Information Systems10.1007/s10115-022-01704-664:8(2023-2058)Online publication date: 27-Jun-2022
https://doi.org/10.1007/s10115-022-01704-6
Hasan MRafiqul Islam MMugdha A(2022)Chemical Reaction Optimization (CRO) for Maximum Clique ProblemModeling, Simulation and Optimization10.1007/978-981-19-0836-1_7(85-96)Online publication date: 29-Jun-2022
https://doi.org/10.1007/978-981-19-0836-1_7
Fallah MKeshvari VFazlali M(2019)A Parallel Hybrid Genetic Algorithm for Solving the Maximum Clique ProblemHigh-Performance Computing and Big Data Analysis10.1007/978-3-030-33495-6_29(378-393)Online publication date: 20-Oct-2019
https://doi.org/10.1007/978-3-030-33495-6_29
Moussa RAkiki RHarmanani H(2019)A Genetic Algorithm for the Maximum Clique Problem16th International Conference on Information Technology-New Generations (ITNG 2019)10.1007/978-3-030-14070-0_80(569-574)Online publication date: 23-May-2019
https://doi.org/10.1007/978-3-030-14070-0_80
Wang QLiu D(2018)Research on Load Balancing Method in Cloud Computing2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)10.1109/IAEAC.2018.8577591(1489-1493)Online publication date: Oct-2018
https://doi.org/10.1109/IAEAC.2018.8577591
Yezerska OButenko S(2018)The Maximum Clique and Vertex ColoringHandbook of Heuristics10.1007/978-3-319-07153-4_47-1(1-31)Online publication date: 7-Feb-2018
https://doi.org/10.1007/978-3-319-07153-4_47-1
Yezerska OButenko S(2018)The Maximum Clique and Vertex ColoringHandbook of Heuristics10.1007/978-3-319-07124-4_47(1259-1289)Online publication date: 14-Aug-2018
https://doi.org/10.1007/978-3-319-07124-4_47
Assad ADeep K(2017)A heuristic based harmony search algorithm for maximum clique problemOPSEARCH10.1007/s12597-017-0325-655:2(411-433)Online publication date: 7-Sep-2017
https://doi.org/10.1007/s12597-017-0325-6
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Solving the maximum clique problem by k-opt local search

Subgraph extraction and metaheuristics for the maximum clique problem

An effective local search for the maximum clique problem

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

Cited By

Index Terms

Recommendations

Solving the maximum clique problem by k-opt local search

Subgraph extraction and metaheuristics for the maximum clique problem

An effective local search for the maximum clique problem

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations