Maximum cut-clique problem: ILS heuristics and a data analysis application

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Transactions in Operational Research

• Publication date

  2015-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1111/itor.12120
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations

  2015cited by this paper
• Extending market basket analysis with graph mining techniques: A real case

  2014cited by this paper
• Maximising the Size of Non-Redundant Protein Datasets Using Graph Theory

  2013cited by this paper
• Privacy preserving association rule mining over distributed databases using genetic algorithm

  2013cited by this paper
• Cliques with maximum/minimum edge neighborhood and neighborhood density

  2012cited by this paper
• A product network analysis for extending the market basket analysis

  2012cited by this paper
• Sequential market basket analysis

  2012cited by this paper
• Using Market Basket Analysis in Management Research

  2012cited by this paper
• Dynamic Local Search for the Maximum Clique Problem

  2011cited by this paper
• Market basket analysis with networks

  2011cited by this paper
• Extended and discretized formulations for the maximum clique problem

  2010influential reference
• Modeling a Store's Product Space as a Social Network

  2009cited by this paper
• A sequential elimination algorithm for computing bounds on the clique number of a graph

  2008cited by this paper
• Simple ingredients leading to very efficient heuristics for the maximum clique problem

  2008cited by this paper
• Database Paper - The IRI Marketing Data Set

  2008cited by this paper
• An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

  2007cited by this paper
• A scalable algorithm for the market basket analysis

  2007influential reference
• A study of ACO capabilities for solving the maximum clique problem

  2006cited by this paper
• A Convex Quadratic Characterization of the Lovász Theta Number

  2005cited by this paper
• Optimal Protein Structure Alignment Using Maximum Cliques

  2005influential reference
• An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique

  2003cited by this paper
• Protein complexes and functional modules in molecular networks

  2003cited by this paper
• Studying Complex Discursive Systems: Centering Resonance Analysis of Communication.

  2002cited by this paper
• A fast algorithm for the maximum clique problem

  2002cited by this paper
• Iterated Local Search

  2001cited by this paper
• Reactive Local Search for the Maximum Clique Problem1

  2001cited by this paper
• Algorithms for association rule mining — a general survey and comparison

  2000cited by this paper
• Parallel and distributed association mining: a survey

  1999cited by this paper
• The Maximum Clique Problem

  1999cited by this paper
• Cliques, Coloring, and Satisfiability

  1996cited by this paper
• Free bits, PCPs and non-approximability-towards tight results

  1995cited by this paper
• A multi-KP modeling for the maximum-clique problem

  1994cited by this paper
• Finding interesting rules from large sets of discovered association rules

  1994cited by this paper
• A Note on the Approximation of the MAX CLIQUE Problem

  1991cited by this paper
• Reducibility Among Combinatorial Problems

  1972influential reference

• Complexity and heuristics for the weighted max cut-clique problem

  2020cites this paper
• A Fast Genetic Algorithm for the Max Cut-Clique Problem

  2020cites this paper
• Iterated Local Search: Applications and Extensions

  2019cites this paper
• A GRASP/VND Heuristic for the Max Cut-Clique Problem

  2018cites this paper
• Logic learning and optimized drawing: two hard combinatorial problems

  2018influential citation
• Complexity and Heuristics for the Max Cut-Clique Problem

  2018cites this paper
• A characterization of minimally connected graphs without 2-clique cutsets

  year unknowncites this paper