Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs

DOI10.1007/BF01918201zbMath0581.90092MaRDI QIDQ3705237

Helmuth Späth

Publication date: 1985

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

minimal cost; minimal distance; heuristic solution methods; weighted complete graph; clique of given cardinality; facilities selection

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

Related Items

A Lagrangian relaxation approach to the edge-weighted clique problem, An extended formulation approach to the edge-weighted maximal clique problem, A cutting-plane approach to the edge-weighted maximal clique problem, New facets and a branch-and-cut algorithm for the weighted clique problem., The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations, A new family of facet defining inequalities for the maximum edge-weighted clique problem, A polyhedral approach for a constrained quadratic 0-1 problem, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Cites Work

• The facility selection-location problem
• Probabilistic asymptotic properties of some combinatorial optimization problems