Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering

DOI10.1016/S0305-0548(00)00053-8zbMath1032.90034OpenAlexW2038174373WikidataQ127305881 ScholiaQ127305881MaRDI QIDQ5955469

Markus Schneider, Stefan Irnich, Hans-Juergen Zimmermann, Tore Grünert, Burkhard Wulfhorst

Publication date: 13 February 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00053-8

zbMATH Keywords

branch and boundbraidingmaximum clique

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (6)

On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs ⋮ On finding \(k\)-cliques in \(k\)-partite graphs ⋮ Computational Studies of Randomized Multidimensional Assignment Problems ⋮ The clique problem with multiple-choice constraints under a cycle-free dependency graph ⋮ A new branch-and-filter exact algorithm for binary constraint satisfaction problems ⋮ Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph

Uses Software

• TABARIS
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Clique detection for nondirected graphs: Two new algorithms
• Solving the maximum clique problem using a tabu search approach
• Finding a Maximum Clique in an Arbitrary Graph
• A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
• Vertex packings: Structural properties and algorithms
• A node covering algorithm
• Algorithm 457: finding all cliques of an undirected graph
• A branch and bound algorithm for the maximum clique problem

This page was built for publication: Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering