{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T02:14:42Z","timestamp":1712024082170},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T00:00:00Z","timestamp":1311984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10589-011-9423-1","type":"journal-article","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T10:38:29Z","timestamp":1311935909000},"page":"507-535","source":"Crossref","is-referenced-by-count":3,"title":["Automated knowledge source selection and service composition"],"prefix":"10.1007","volume":"52","author":[{"given":"Patrick N.","family":"Bless","sequence":"first","affiliation":[]},{"given":"Diego","family":"Klabjan","sequence":"additional","affiliation":[]},{"given":"Soo Y.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,30]]},"reference":[{"key":"9423_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, Upper Saddle River (1993)"},{"key":"9423_CR2","unstructured":"Arkin, A., Askary, S., Fordin, S., Jekeli, W., Kawaguchi, K., Orchard, D., Pogliani, S., Riemer, K., Strublen, S., Takacsi-Nagy, P., Trickovic, I., Zimek, S.: Web service choreography interface (WSCI) 1.0. Technical report, W3C, 2002. http:\/\/www.w3.org\/TR\/wsci"},{"key":"9423_CR3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A. Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G., Savelsbergh, M.: Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121, 40\u201355 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9423_CR4","volume-title":"Middleware","author":"D. Bakken","year":"2001","unstructured":"Bakken, D.: Middleware. Kluwer Academic Press, Norwell (2001"},{"key":"9423_CR5","unstructured":"Bless, P.: Automated knowledge source selection and service composition in manufacturing. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL (2004)"},{"key":"9423_CR6","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1115\/1.1954792","volume":"127","author":"P. Bless","year":"2005","unstructured":"Bless, P., Kapoor, S., DeVor, R., Klabjan, D.: An algorithmic strategy for automated generation of multi-component software tools for virtual manufacturing. ASME J. Manuf. Sci. Eng. 127, 866\u2013874 (2005)","journal-title":"ASME J. Manuf. Sci. Eng."},{"issue":"4","key":"9423_CR7","doi-asserted-by":"crossref","first-page":"1292","DOI":"10.1016\/j.cor.2006.08.012","volume":"35","author":"P. Bless","year":"2008","unstructured":"Bless, P., Klabjan, D., Chang, S.: Heuristic for automated knowledge source integration and service composition. Comput. Oper. Res. 35(4), 1292\u20131314 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9423_CR8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/5254.747902","volume":"14","author":"B. Chandrasekaran","year":"1999","unstructured":"Chandrasekaran, B., Josepson, J., Benjamins, V.: What are ontologies, and why do we need them? IEEE Intell. Syst. 14, 20\u201326 (1999)","journal-title":"IEEE Intell. Syst."},{"key":"9423_CR9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/69.591458","volume":"9","author":"H.C. Cheng","year":"1997","unstructured":"Cheng, H.C., Jeng, J.-J.: Reusing analogous components. Knowl. Data Eng. 9, 341\u2013349 (1997)","journal-title":"Knowl. Data Eng."},{"key":"9423_CR10","unstructured":"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"},{"issue":"4","key":"9423_CR11","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TKDE.2007.1010","volume":"19","author":"C. Domshlak","year":"2007","unstructured":"Domshlak, C., Gal, A., Roitman, H.: Rank aggregation for automatic schema matching. IEEE Trans. Knowl. Data Eng. (TKDE) 19(4), 538\u2013553 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"key":"9423_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-1-4757-3171-2_10","volume-title":"Advances in Steiner Trees of Combinatorial Optimization","author":"C. Duin","year":"2000","unstructured":"Duin, C.: Preprocessing the Steiner problem in graphs. In: Du, D., Smith, J., Rubinstein, J. (eds.) Advances in Steiner Trees of Combinatorial Optimization, vol. 6, pp.\u00a0175\u2013233. Kluwer Academic, Norwell (2000)"},{"key":"9423_CR13","volume-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop","author":"S. French","year":"1982","unstructured":"French, S.: Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop. Horwood, Chichester (1982)"},{"key":"9423_CR14","volume-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability\u2014A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"4","key":"9423_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02592086","volume":"72","author":"M. Grotchel","year":"1996","unstructured":"Grotchel, M., Martin, A., Weismanel, R.: Packing Steiner trees: a cutting plane algorithm and computation. Math. Program. 72(4), 125\u2013145 (1996)","journal-title":"Math. Program."},{"key":"9423_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory","author":"E. Lawler","year":"1993","unstructured":"Lawler, E., Lenstra, J., Rinnooy-Kan, A., Shmoys, D.: Sequencing and scheduling: algorithms and complexity. In: Graves, S., Rinnooy-Kan, A., Zipkin, P. (eds.) Logistics of Production and Inventory, pp. 445\u2013522. North-Holland, Amsterdam (1993)"},{"key":"9423_CR17","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/5254.920599","volume":"16","author":"S. McIlraith","year":"2001","unstructured":"McIlraith, S.: Semantic web services. IEEE Intell. Syst. 16, 46\u201353 (2001)","journal-title":"IEEE Intell. Syst."},{"key":"9423_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/978-3-540-24694-7_75","volume-title":"MICAI-Advances in Artificial Intelligence","author":"M. Osorio Lama","year":"2004","unstructured":"Osorio Lama, M., Pinto, D.: A preprocessing that combines heuristic and surrogate constraint analysis to fix variables in TSP. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L., Azuela, J. (eds.) MICAI-Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol. 2972, pp. 727\u2013734. Springer, New York (2004)"},{"key":"9423_CR19","doi-asserted-by":"crossref","unstructured":"Peltz, C.: Web services orchestration\u2014a review of emerging technologies, tools, and standards. Technical report, Hewlett Packard (2003)","DOI":"10.1109\/MC.2003.1236471"},{"key":"9423_CR20","volume-title":"Graph Theory","author":"J. Plesn\u00edk","year":"1983","unstructured":"Plesn\u00edk, J.: Graph Theory. Veda, Bratislava (1983)"},{"key":"9423_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/ICDE.2010.5447853","volume-title":"2010 IEEE 26th International Conference on Data Engineering (ICDE)","author":"B. Saha","year":"2010","unstructured":"Saha, B., Stanoi, I., Clarkson, K.: Schema covering: a step towards enabling reuse in information integration. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE), pp. 285\u2013296 (2010). doi: 10.1109\/ICDE.2010.5447853"},{"key":"9423_CR22","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6, 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"key":"9423_CR23","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MIS.2003.1179197","volume":"18","author":"S. Staab","year":"2003","unstructured":"Staab, S.: Web services: Been there, done that? IEEE Intell. Syst. 18, 72\u201385 (2003)","journal-title":"IEEE Intell. Syst."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9423-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9423-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9423-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T11:17:33Z","timestamp":1560424653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9423-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,30]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9423"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9423-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,30]]}}}