scientific article
From MaRDI portal
Publication:3623999
zbMath1182.68065arXiv1109.5717MaRDI QIDQ3623999
No author found.
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1109.5717
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Subgraph extraction and metaheuristics for the maximum clique problem, Phased local search for the maximum clique problem, A review on algorithms for maximum clique problems, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, Clustered maximum weight clique problem: algorithms and empirical analysis, Frequency-driven tabu search for the maximum \(s\)-plex problem, Breakout local search for maximum clique problems, A new exact maximum clique algorithm for large and massive sparse graphs, An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network, An adaptive multistart tabu search approach to solve the maximum clique problem, Finding near-optimal independent sets at scale, An efficient local search algorithm for solving maximum edge weight clique problem in large graphs, Reinforcement learning for combinatorial optimization: a survey, An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†, A Max-SAT Inference-Based Pre-processing for Max-Clique, Complete Boolean satisfiability solving algorithms based on local search, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Improvements to MCS algorithm for the maximum clique problem, Incremental Upper Bound for the Maximum Clique Problem, A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs, Fast local search for the maximum independent set problem, PUSH: A generalized operator for the maximum vertex weight clique problem, Speeding up branch and bound algorithms for solving the maximum clique problem, Multi-neighborhood tabu search for the maximum weight clique problem, An efficient local search framework for the minimum weighted vertex cover problem, A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems, Incremental optimization of independent sets under the reconfiguration framework, Approximating the maximum vertex/edge weighted clique using local search, Simple ingredients leading to very efficient heuristics for the maximum clique problem, SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem, Distributed Load Identification for Uncertain Structure Based on LHS-GA and Improved L-Curve Method, Reactive and dynamic local search for max-clique: engineering effective building blocks, An Efficient Local Search for the Minimum Independent Dominating Set Problem
Uses Software
