The following pages link to The maximum clique problem (Q1318271):
Displaying 50 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Maximum weighted induced subgraphs (Q279221) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- Geometry of the copositive and completely positive cones (Q534759) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- Communicability graph and community structures in complex networks (Q833142) (← 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)
- Pairwise compatibility graphs (Q1032039) (← links)
- Reactive and dynamic local search for max-clique: engineering effective building blocks (Q1038292) (← links)
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm (Q1040788) (← 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)
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← 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)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- Dynamic node packing (Q2097666) (← links)
