Upper bounds and heuristics for the 2-club problem

Given an undirected graph G = ( V, E), a k-club is a subset of V that induces a subgraph of diameter at most k. The k-club problem is that of finding the maximum cardinality k-club in G. In this paper we present valid inequalities for the 2-club polytope and derive conditions for them to define face...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 210; H. 3; S. 489 - 494
Hauptverfasser:	Carvalho, Filipa D., Almeida, M. Teresa
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.05.2011 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	Applied sciences Combinatorial optimization Combinatorial optimization Integer programming k-club problem Heuristics Computer science; control theory; systems Cutting Density Exact sciences and technology Flows in networks. Combinatorial problems Graph theory Graphs Heuristic Heuristics Inequalities Information retrieval. Graph Integer programming k-club problem Linear programming Mathematical models Mathematical programming Operational research Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Studies Theoretical computing Upper bounds Integer programming k-club problem Combinatorial optimization Heuristics Polytope Linear programming Cutting plane method Upper bound Cardinal number Optimal solution Heuristic method Subgraph Relaxation method Diameter Non directed graph
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!