A multi-KP modeling for the maximum-clique problem
From MaRDI portal
Publication:1328650
DOI10.1016/0377-2217(94)90252-6zbMath0805.90108OpenAlexW2061824611MaRDI QIDQ1328650
Frederico Della Croce, Roberto Tadei
Publication date: 26 July 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90252-6
Related Items
Extended and discretized formulations for the maximum clique problem, The stable set problem: clique and nodal inequalities revisited, Maximum weight perfect matching problem with additional disjunctive conflict constraints, Cliques with maximum/minimum edge neighborhood and neighborhood density, Solving the maximum edge-weight clique problem in sparse graphs with compact formulations, A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts, Maximum cut-clique problem: ILS heuristics and a data analysis application, Worst-case analysis of clique MIPs, Numerical experiments with LP formulations of the maximum clique problem
Uses Software
Cites Work
- Unnamed Item
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Finding maximum cliques in arbitrary and in special graphs
- An exact algorithm for the maximum clique problem
- Clique detection for nondirected graphs: Two new algorithms
- Finding a Maximum Clique in an Arbitrary Graph
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Determining the number of internal stability of a graph
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Vertex packings: Structural properties and algorithms
- A node covering algorithm
- Algorithm 457: finding all cliques of an undirected graph
