A multi-KP modeling for the maximum-clique problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A node covering algorithm
- Algorithm 457: finding all cliques of an undirected graph
- An exact algorithm for the maximum clique problem
- Clique detection for nondirected graphs: Two new algorithms
- Determining the number of internal stability of a graph
- Finding a Maximum Clique in an Arbitrary Graph
- Finding maximum cliques in arbitrary and in special graphs
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Vertex packings: Structural properties and algorithms
Cited in
(9)- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Numerical experiments with LP formulations of the maximum clique problem
- Extended and discretized formulations for the maximum clique problem
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- Maximum cut-clique problem: ILS heuristics and a data analysis application
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- The stable set problem: clique and nodal inequalities revisited
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Worst-case analysis of clique MIPs
This page was built for publication: A multi-KP modeling for the maximum-clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328650)
