Heuristics for automated knowledge source integration and service composition
type: Item
instance of: scholarly article
title: Heuristics for automated knowledge source integration and service composition
zbMATH Open document ID: 1157.90502
author: Patrick N. Bless
author: Diego Klabjan
author: Soo Y. Chang
published in: Computers \& Operations Research
publication date: 2008-09-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5318752
MaRDI profile type: Publication
full work available at URL: j.cor.2006.08.012
OpenAlex ID: W2108525456
cites work: Q4198056
cites work: Solving NP-hard problems in 'almost trees': vertex cover
cites work: The Steiner tree problem
cites work: Covering the vertex set of a graph with subgraphs of smaller degree
cites work: Minimum cost edge subset covering exactly \(k\) vertices of a graph
cites work: An efficient exact algorithm for constraint bipartite vertex cover
cites work: A graph approximation heuristic for the vertex cover problem on planar graphs
cites work: Q4411285
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: On efficient fixed-parameter algorithms for weighted vertex cover
cites work: The Steiner tree packing problem in VLSI design
cites work: Generalized Steiner problems and other variants
cites work: A constrained Steiner tree problem
cites work: The Steiner tree problem with hop constraints
cites work: A branch and cut algorithm for the Steiner problem in graphs
cites work: Parallel local search for Steiner trees in graphs
cites work: Local search for the Steiner tree problem in the Euclidean plane
cites work: An approach for the Steiner problem in directed graphs
cites work: A note on the terminal Steiner tree problem
cites work: A strong lower bound for the Node Weighted Steiner Tree Problem
cites work: Q4339078
cites work: Genetic local search in combinatorial optimization
cites work: A survey of very large-scale neighborhood search techniques
cites work: An experimental analysis of local minima to improve neighbourhood search.
cites work: Q3056948
DOI: 10.1016/J.COR.2006.08.012
description: scientific article; zbMATH DE number 5318752