Publication:3904382
From MaRDI portal
zbMath0455.90063MaRDI QIDQ3904382
C. Benzaken, Peter L. Hammer, Bruno Simeone
Publication date: 1980
complete bipartite graphsforbidden subgraphsline graphsconflict graphsquadratic graphsmaximal weighted independent subsetquadratic pseudo-boolean functionsunconstrained quadratic 0-1 optimization
Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Boolean programming (90C09) Boolean algebras (Boolean rings) (06E99)
Related Items
Bipartite dimensions and bipartite degrees of graphs, A note on line digraphs and the directed max-cut problem, A solvable class of quadratic 0-1 programming, A pseudo-Boolean consensus approach to nonlinear 0-1 optimization, Pseudo-Boolean optimization, A branch and bound algorithm for the maximum clique problem, Consensus algorithms for the generation of all maximal bicliques