BHOSLIB
From MaRDI portal
Software:20230
swMATH8220MaRDI QIDQ20230FDOQ20230
Author name not available (Why is that?)
Cited In (18)
- Subgraph extraction and metaheuristics for the maximum clique problem
- An Efficient Local Search for the Minimum Independent Dominating Set Problem
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling
- Carousel greedy: a generalized greedy algorithm with applications in optimization
- Clustered maximum weight clique problem: algorithms and empirical analysis
- On comparing algorithms for the maximum clique problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Solving maximum weight clique using maximum satisfiability reasoning
- Multi-neighborhood tabu search for the maximum weight clique problem
- Fast local search for the maximum independent set problem
- Fractional edge cover number of Model RB
- Finding the maximum multi improvement on neighborhood exploration
- Efficiently enumerating all maximal cliques with bit-parallelism
- NuMVC: an efficient local search algorithm for minimum vertex cover
- Two Hardness Results on Feedback Vertex Sets
This page was built for software: BHOSLIB
