Heuristics for automated knowledge source integration and service composition

Computers and Operations Research

Volumn 35, Issue 4, 2008, Pages 1292-1314

  Bless, Patrick N ^a   Klabjan, Diego ^a   Chang, Soo Y ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; INFORMATION SERVICES; KNOWLEDGE ENGINEERING; PROBLEM SOLVING; SET THEORY;

COMPONENT SET IDENTIFICATION PROBLEMS; KNOWLEDGE SOURCE/SERVICE COMPOSITION;

HEURISTIC ALGORITHMS;

EID: 34548642199     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.08.012     Document Type: Article

References (36)

1. McIlraith S. Semantic web services. IEEE Intelligent Systems 16 (2001) 46-53
2. Christensen E, Curbera F, Meredith G, Weerawarana S. Web services description language 1.1 (WSDL). Technical Report, W3C, 2001. 〈http://www.w3.org/TR/WSDL〉.
3. Staab S. Web services: Been there, done that?. IEEE Intelligent Systems 18 (2003) 72-85
4. Arkin A, Askary S, Fordin S, Jekeli W, Kawaguchi K, Orchard D, et al. Web service choreography interface (WSCI) 1.0. Technical Report, W3C, 2002. 〈http://www.w3.org/TR/WSCI〉.
5. Peltz C. Web services orchestration-a review of emerging technologies, tools, and standards. Technical Report. Hewlett Packard; 2003.
6. Cheng H.C., and Jeng J.-J. Reusing analogous components. Knowledge and Data Engineering 9 (1997) 341-349
7. Chandrasekaran B., Josepson J., and Benjamins V. What are ontologies, and why do we need them?. IEEE Intelligent Systems 14 (1999) 20-26
8. Bakken D. Middleware (2001), Kluwer Academic Press, Norwell, MA
9. Bless P, Klabjan D, Chang S. Automated knowledge source integration and service composition. Technical Report. University of Illinois at Urbana-Champaign, 2006. Available at 〈http://netfiles.uiuc.edu/klabjan/www〉 or 〈http://www.knowledgesources.net〉.
10. Garey M., and Johnson D. Computers and intractability-a guide to the theory of NP-completeness (1979), W.H. Freeman, New York, NY
11. Coppersmith D., and Vishkin U. Solving NP-hard problems in 'almost trees': vertex cover. Discrete Applied Mathematics 10 (1985) 27-45
12. Hwang F.K., Richards D.S., and Winter P. The Steiner tree problem. Annals of Discrete Mathematics (1992), North-Holland, Amsterdam
13. Lawrence J. Covering the vertex set of a graph with subgraphs of smaller degree. Discrete Mathematics 21 (1978) 61-68
14. Plesnik J. Minimum cost edge subset covering exactly k vertices of a graph. Journal of Combinatorial Optimization 5 (2001) 275-286
15. Fernau H., and Niedermeier R. An efficient exact algorithm for constraint bipartite vertex cover. Journal of Algorithms 38 (2001) 374-410
16. Meek D.L., and Parker R.G. A graph approximation heuristic for the vertex cover problem on planar graphs. European Journal of Operational Research 72 (1994) 588-597
17. Halperin E, Srinivasan A. Improved approximation algorithms for the partial vertex cover problem. Lecture notes in Computer Science 2002, vol. 2462. p. 161-74.
18. Bar-Yehuda R., and Even S. A linear-time approximation algorithm for the weighted vertex cover problems. Journal of Algorithms 2 (1981) 198-203
19. Niedermeier R., and Rossmanith P. On efficient fixed-parameter algorithms for weighted vertex cover. Journal of Algorithms 47 (2003) 63-77
20. Groetschel M., Martin A., and Weismantel R. The Steiner tree packing problem in VLSI design. Mathematical Programming 78 (1997) 265-281
21. Dror M., and Haouari M. Generalized Steiner problems and other variants. Journal of Combinatorial Optimization 4 (2000) 415-436
22. Rosenwein M.B., and Wong R.T. A constrained Steiner tree problem. European Journal of Operational Research 81 (1995) 430-439
23. Voss S. The Steiner tree problem with hop constraints. Annals of Operations Research 86 (1999) 321-346
24. Lucena A., and Beasley J.E. A branch and cut algorithm for the Steiner problem in graphs. Networks 31 (1998) 39-59
25. Verhoeven M.G.A. Parallel local search for Steiner trees in graphs. Annals of Operations Research 90 (1999) 185-202
26. Zachariasen M. Local search for the Steiner tree problem in the Euclidean plane. European Journal of Operational Research 119 (1999) 282-300
27. Maculan N., Souza P., and Vejar A.C. An approach for the Steiner problem in directed graphs. Annals of Operations Research 33 (1991) 471-480
28. Fuchs B. A note on the terminal Steiner tree problem. Information Processing Letters 87 (2003) 219-220
29. Engevall S., Goethe-Lundgren M., and Vaerbrand S.A. Strong lower bound for the node weighted Steiner tree problem. Networks 31 (1998) 11-17
30. Aarts E., and Lenstra J. Local search in combinatorial optimization (1997), Wiley, New York, NY
31. Glover F., and Kochenberger G. Handbook of metaheuristics (2002), Kluwer Academic Publishers, Norwell, MA
32. Kolen A., and Pesch E. Genetic local search in combinatorial optimization. Discrete Applied Mathematics 48 (1994) 273-284
33. Ahuja R., Ergun O., Orlin J., and Punnen A. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123 (2002) 75-102
34. Steinhöfel K., Albrecht A., and Wong C.K. An experimental analysis of local minima to improve neighbourhood search. Computers and Operations Research 30 (2003) 2157-2173
35. Ahuja R., Magnanti T., and Orlin J. Network flows (1993), Prentice-Hall, Upper Saddle River
36. Bless P. Automated knowledge source selection and service composition in manufacturing. Ph.D. thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 2004.