A clique search problem and its application to machine scheduling

DOI10.1007/s43069-021-00111-xzbMath1483.90145OpenAlexW4200120110MaRDI QIDQ2068853

Sándor Szabó

Publication date: 20 January 2022

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-021-00111-x

zbMATH Keywords

combinatorial optimizationweighted maximum cliqueclique and chromatic numberspractical solutions of NP-complete problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Uses Software

• MaxCliqueDyn
• BBMCL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the maximum clique problem
• Test case generators and computational results for the maximum clique problem
• A fast algorithm for the maximum clique problem
• Relaxed approximate coloring in exact maximum clique search
• Improvements to MCS algorithm for the maximum clique problem
• Estimating the Efficiency of Backtrack Programs
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Algorithms for minclique scheduling problems

This page was built for publication: A clique search problem and its application to machine scheduling