The following pages link to The maximum clique problem (Q1318271):
Displayed 29 items.
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- Facets for node packing (Q1278997) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- A potential reduction approach to the frequency assignment problem (Q1377670) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
- Neural networks for NP-complete problems (Q4377229) (← links)
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning (Q4816960) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
- A quadratic programming approach to the determination of an upper bound on the weighted stability number (Q5939588) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)