The following pages link to (Q4714131):
Displaying 25 items.
- SAT race 2015 (Q334795) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Compact representations of all members of an independence system (Q513340) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem (Q2139271) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Solving maximum independent set by asynchronous distributed hopfield-type neural networks (Q3431447) (← links)
- Graph Coloring Lower Bounds from Decision Diagrams (Q5041761) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
