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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 210; číslo 3; s. 489 - 494
Hlavní autoři:	Carvalho, Filipa D., Almeida, M. Teresa
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.05.2011 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!