scientific article; zbMATH DE number 6869281
From MaRDI portal
Publication:4640250
zbMath1387.05257MaRDI QIDQ4640250
Mikhail Batsyn, Segundo Pablo san, Alexey Nikolaev, Panos M. Pardalos
Publication date: 17 May 2018
Full work available at URL: https://content.iospress.com/articles/informatica/inf1093
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationbranch-and-boundmaximum cliquemaximum satisfiabilityexact searchapproximate-colouring
Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A new branch-and-bound algorithm for the maximum edge-weighted clique problem, CliSAT: a new exact algorithm for hard maximum clique problems, The maximum clique interdiction problem, A new branch-and-bound algorithm for the maximum weighted clique problem, A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts, A branch-and-cut algorithm for the edge interdiction clique problem, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, A maximum edge-weight clique extraction algorithm based on branch-and-bound
