scientific article; zbMATH DE number 1947416

MaRDI QIDQ4411385zbMATH OpenFDO

Authors Torsten Fahle

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610485.htm

zbMATH Keywords

branch-and-boundconstraint programmingcost based filteringmaximum clique

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• A simple and faster branch-and-bound algorithm for finding a maximum clique
• A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• A fast algorithm for the maximum clique problem
• scientific article; zbMATH DE number 2040957
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

Cited in

(25)

• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
• On comparing algorithms for the maximum clique problem
• Exact algorithms for maximum clique: a computational study
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Incomplete inference for graph problems
• A new branch-and-bound algorithm for the maximum weighted clique problem
• Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
• Speeding up branch and bound algorithms for solving the maximum clique problem
• A logical approach to efficient Max-SAT solving
• Improvements to MCS algorithm for the maximum clique problem
• Exploiting semidefinite relaxations in constraint programming
• A review on algorithms for maximum clique problems
• Extended and discretized formulations for the maximum clique problem
• Ellipsoidal relaxations of the stable set problem: theory and algorithms
• A new approach to the stable set problem based on ellipsoids
• Infra-chromatic bound for exact maximum clique search
• A Max-SAT Inference-Based Pre-processing for Max-Clique
• Clique Inference Process for Solving Max-CSP
• Incremental Upper Bound for the Maximum Clique Problem
• An adaptive neighborhood search for k-clustering minimum bi-clique completion problems
• Principles and Practice of Constraint Programming – CP 2004
• CliSAT: a new exact algorithm for hard maximum clique problems
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411385)