BHOSLIB
From MaRDI portal
Software:20230
No author found.
Related Items (18)
Subgraph extraction and metaheuristics for the maximum clique problem ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ Carousel greedy: a generalized greedy algorithm with applications in optimization ⋮ Clustered maximum weight clique problem: algorithms and empirical analysis ⋮ A biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ On comparing algorithms for the maximum clique problem ⋮ Local search with edge weighting and configuration checking heuristics for minimum vertex cover ⋮ Unnamed Item ⋮ Fractional Edge Cover Number of Model RB ⋮ Two Hardness Results on Feedback Vertex Sets ⋮ Fast local search for the maximum independent set problem ⋮ NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover ⋮ Multi-neighborhood tabu search for the maximum weight clique problem ⋮ Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling ⋮ Finding the maximum multi improvement on neighborhood exploration ⋮ A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs ⋮ An Efficient Local Search for the Minimum Independent Dominating Set Problem
This page was built for software: BHOSLIB
