A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
From MaRDI portal
Publication:5085477
DOI10.1287/ijoc.2020.0984OpenAlexW2801405741MaRDI QIDQ5085477
Stefan Irnich, Fabio Furini, Timo Gschwind, Roberto Wolfler Calvo
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1723.pdf
Related Items
Cites Work
- Unnamed Item
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Algorithms for the maximum \(k\)-club problem in graphs
- An exact approach for the vertex coloring problem
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Branching in branch-and-price: A generic scheme
- An introduction to timetabling
- A graph coloring algorithm for large scale scheduling problems
- Cliques and clustering: A combinatorial approach
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- A fast algorithm for the maximum clique problem
- Maximum weight relaxed cliques and Russian doll search revisited
- On the maximum quasi-clique problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- On clique relaxation models in network analysis
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- A survey on vertex coloring problems
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Efficiency of a Good But Not Linear Set Union Algorithm
- Community structure in social and biological networks
- Column Generation
- Integer models and upper bounds for the 3‐club problem
- Network Analysis
