scientific article

zbMath0567.05031MaRDI QIDQ3682509

Christian Ebenegger, Dominique de Werra, Peter L. Hammer

Publication date: 1984

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

zbMATH Keywords

Boolean methodsstability of graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Related Items

Quelques utilisations de la STRUCTION. (Some applications of STRUCTION), The struction algorithm for the maximum stable set problem revisited, Solving the maximum clique problem using a tabu search approach, Polynomially solvable cases for the maximum stable set problem, The complexity of approximating a nonlinear program, On the use of Boolean methods for the computation of the stability number, From matchings to independent sets, Bipartite dimensions and bipartite degrees of graphs, Unnamed Item, Struction revisited, Stability preserving transformations of graphs, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem, On Some Properties of the Struction of a Graph, Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization, Pseudo-Boolean optimization, Consensus algorithms for the generation of all maximal bicliques, Improved upper bounds for vertex cover, Graph transformations preserving the stability number, TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph, Stability in CAN-free graphs, Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems, Extending the MAX algorithm for maximum independent set, The maximum clique problem, Local transformations of graphs preserving independence number