scientific article; zbMATH DE number 1786225

zbMath1003.68117MaRDI QIDQ4547547

Patric R. J. Östergård

Publication date: 21 October 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum clique problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (30)

Minimum cost edge blocker clique problem ⋮ A polyhedral study of the maximum stable set problem with weights on vertex-subsets ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ A branch-and-check approach for a wind turbine maintenance scheduling problem ⋮ Permutation codes with specified packing radius ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ Integral simplex using decomposition with primal cutting planes ⋮ A preemptive bound for the resource constrained project scheduling problem ⋮ On risk-averse maximum weighted subgraph problems ⋮ An exact approach for the vertex coloring problem ⋮ Incomplete inference for graph problems ⋮ Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation ⋮ Optimal \((n,4,2)\)-OOC of small orders. ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Parallelization of a branch-and-bound algorithm for the maximum weight clique problem ⋮ A hybrid iterated local search heuristic for the maximum weight independent set problem ⋮ A clique algorithm for standard quadratic programming ⋮ General cut-generating procedures for the stable set polytope ⋮ PUSH: A generalized operator for the maximum vertex weight clique problem ⋮ Multi-neighborhood tabu search for the maximum weight clique problem ⋮ Optimal wafer cutting in shuttle layout problems ⋮ Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound ⋮ Foldabilizing furniture ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ A clique search problem and its application to machine scheduling ⋮ A new table of permutation codes ⋮ A maximum edge-weight clique extraction algorithm based on branch-and-bound

This page was built for publication: