scientific article; zbMATH DE number 939919
From MaRDI portal
zbMath0851.00080MaRDI QIDQ4714131
No author found.
Publication date: 29 October 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
Subgraph extraction and metaheuristics for the maximum clique problem, Graph Coloring Lower Bounds from Decision Diagrams, Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem, SAT race 2015, Efficiently enumerating all maximal cliques with bit-parallelism, Carousel greedy: a generalized greedy algorithm with applications in optimization, The worst-case time complexity for generating all maximal cliques and computational experiments, An adaptive multistart tabu search approach to solve the maximum clique problem, Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations, Strong lift-and-project cutting planes for the stable set problem, On the parameterized vertex cover problem for graphs with perfect matching, Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover, Approximating minimal unsatisfiable subformulae by means of adaptive core search, A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic, Graph signatures: identification and optimization, Compact representations of all members of an independence system, Fast local search for the maximum independent set problem, A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs, The generalized independent set problem: polyhedral analysis and solution approaches, A polyhedral study of the maximum edge subgraph problem, A complete adaptive algorithm for propositional satisfiability, Solving maximum independent set by asynchronous distributed hopfield-type neural networks, An exact algorithm for the maximum \(k\)-club problem in an undirected graph, Heuristics for semirandom graph problems, Graph coloring with decision diagrams
Uses Software
