Heuristics for automated knowledge source integration and service composition
From MaRDI portal
Publication:941554
DOI10.1016/j.cor.2006.08.012zbMath1157.90502OpenAlexW2108525456MaRDI QIDQ941554
Diego Klabjan, Patrick N. Bless, 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Automated knowledge source selection and service composition ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Combinatorial optimization in system configuration design
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Heuristics for automated knowledge source integration and service composition
- A note on the terminal Steiner tree problem
- Solving NP-hard problems in 'almost trees': vertex cover
- A constrained Steiner tree problem
- An approach for the Steiner problem in directed graphs
- The Steiner tree problem
- Covering the vertex set of a graph with subgraphs of smaller degree
- The Steiner tree problem with hop constraints
- Genetic local search in combinatorial optimization
- A graph approximation heuristic for the vertex cover problem on planar graphs
- The Steiner tree packing problem in VLSI design
- An experimental analysis of local minima to improve neighbourhood search.
- Generalized Steiner problems and other variants
- Local search for the Steiner tree problem in the Euclidean plane
- Parallel local search for Steiner trees in graphs
- An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
- A linear-time approximation algorithm for the weighted vertex cover problem
- A strong lower bound for the Node Weighted Steiner Tree Problem
- A branch and cut algorithm for the Steiner problem in graphs
- On efficient fixed-parameter algorithms for weighted vertex cover
- Minimum cost edge subset covering exactly \(k\) vertices of a graph
This page was built for publication: Heuristics for automated knowledge source integration and service composition
