A multi-KP modeling for the maximum-clique problem
From MaRDI portal
Publication:1328650
DOI10.1016/0377-2217(94)90252-6zbMATH Open0805.90108OpenAlexW2061824611MaRDI QIDQ1328650FDOQ1328650
Authors: F. 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
Recommendations
Cites Work
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- Vertex packings: Structural properties and algorithms
- Finding a Maximum Clique in an Arbitrary Graph
- An exact algorithm for the maximum clique problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Finding maximum cliques in arbitrary and in special graphs
- Determining the number of internal stability of a graph
- Clique detection for nondirected graphs: Two new algorithms
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- A node covering algorithm
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
Uses Software
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)
