Heuristics for automated knowledge source integration and service composition

DOI10.1016/J.COR.2006.08.012MaRDI QIDQ941554zbMATH OpenOpenAlexFDO

Authors Patrick N. Bless, Diego Klabjan, Soo Y. Chang

Publication date 1 September 2008

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2006.08.012

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Automated knowledge source selection and service composition
• Combining Multiple Heuristics
• scientific article; zbMATH DE number 2089422
• Approximating Component Selection with General Costs
• The computational complexity of and approximation algorithms for variants of the component selection problem

Cites work

• A branch and cut algorithm for the Steiner problem in graphs
• A constrained Steiner tree problem
• A graph approximation heuristic for the vertex cover problem on planar graphs
• A linear-time approximation algorithm for the weighted vertex cover problem
• A note on the terminal Steiner tree problem
• A strong lower bound for the Node Weighted Steiner Tree Problem
• A survey of very large-scale neighborhood search techniques
• An approach for the Steiner problem in directed graphs
• An efficient exact algorithm for constraint bipartite vertex cover
• An experimental analysis of local minima to improve neighbourhood search.
• Covering the vertex set of a graph with subgraphs of smaller degree
• Generalized Steiner problems and other variants
• Genetic local search in combinatorial optimization
• Heuristics for automated knowledge source integration and service composition
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1947055 (Why is no real title available?)
• Local search for the Steiner tree problem in the Euclidean plane
• Minimum cost edge subset covering exactly k vertices of a graph
• Network flows. Theory, algorithms, and applications.
• On efficient fixed-parameter algorithms for weighted vertex cover
• Parallel local search for Steiner trees in graphs
• Solving NP-hard problems in 'almost trees': vertex cover
• The Steiner tree packing problem in VLSI design
• The Steiner tree problem
• The Steiner tree problem with hop constraints

Cited in

(3)

• Combinatorial optimization in system configuration design
• Automated knowledge source selection and service composition
• Heuristics for automated knowledge source integration and service composition

This page was built for publication: Heuristics for automated knowledge source integration and service composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941554)