{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:16:31Z","timestamp":1725538591341},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441902207"},{"type":"electronic","value":"9781441902214"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-4419-0221-4_10","type":"book-chapter","created":{"date-parts":[[2009,10,3]],"date-time":"2009-10-03T04:01:49Z","timestamp":1254542509000},"page":"73-79","source":"Crossref","is-referenced-by-count":1,"title":["A Logic-Based Approach to Solve the Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Mohamed El Bachir","family":"Menai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1_10","unstructured":"Cha, B., Iwama, K., Kambayashi, Y., Miyazaki, S.: Local search algorithms for Partial MAXSAT. In Proc. AAAI-97, (1997), 263\u2013268"},{"key":"10_CR2_10","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In Proc. 3rd ACM Symposium of the Theory of Computation, (1971) 263\u2013268","DOI":"10.1145\/800157.805047"},{"key":"10_CR3_10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230260403","volume":"26","author":"H. Esbensen","year":"1995","unstructured":"Esbensen, H.: Computing near-optimal solutions to the Steiner problem in graphs using a genetic algorithm. Networks 26, (1995) 173\u2013185","journal-title":"Networks"},{"key":"10_CR4_10","doi-asserted-by":"crossref","unstructured":"Fu, Z., Malik, S.: On solving the Partial MAX-SAT problem. In Proc. SAT'06, LNCS 4121, (2006) 252\u2013265","DOI":"10.1007\/11814948_25"},{"issue":"2","key":"10_CR5_10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<162::AID-NET9>3.0.CO;2-9","volume":"34","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., Larochelle, J.-F., Sans\u00f2, B.: A tabu search heuristic for the Steiner tree problem. Networks 34(2), (1999) 162\u2013172","journal-title":"Networks"},{"key":"10_CR6_10","unstructured":"Jiang, Y., Kautz, H.A., Selman, B.: Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. In Proc. 1st Inter. Joint Workshop on Artificial Intelligence and Operations Research, (1995)"},{"key":"10_CR7_10","doi-asserted-by":"crossref","unstructured":"Kahng, A.B., Robins, G.: On optimal interconnections for VLSI. Kluwer Publishers, (1995)","DOI":"10.1007\/978-1-4757-2363-2"},{"key":"10_CR8_10","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In E. Miller and J.W. Thatcher, eds, Complexity of Computer Computations, Plenum Press, (1972) 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10_CR9_10","unstructured":"Mena\u00ef, M.B., Batouche, M.: A backbone-based co-evolutionary heuristic for Partial MAX-SAT. In Proc. EA-2005, LNCS 3871, (2006) 155\u2013166, Springer-Verlag"},{"issue":"7","key":"10_CR10_10","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/j.comcom.2008.01.022","volume":"31","author":"U.T. Nguyen","year":"2008","unstructured":"Nguyen, U.T.: On multicast routing in wireless mesh networks. Computer Communications 31(7), (2008), 1385\u20131399","journal-title":"Computer Communications"},{"key":"10_CR11_10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1287\/ijoc.3.3.213","volume":"3","author":"L.J. Osborne","year":"1991","unstructured":"Osborne, L.J., Gillett, B.E.: A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing 3, (1991), 213\u2013225","journal-title":"ORSA Journal on Computing"},{"key":"10_CR12_10","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In Proc. AAAI-94, (1994) 337\u2013343"},{"key":"10_CR13_10","unstructured":"Slaney, J., Walsh, T.: Backbones in optimization and approximation. In Proc. IJCAI-01, (2001) 254\u2013259"},{"key":"10_CR14_10","unstructured":"Telelis, O., Stamatopoulos, P.: Heuristic backbone sampling for maximum satisfiability. In Proc. 2nd Hellenic Conference on AI, (2002) 129\u2013139"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-0221-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T20:10:26Z","timestamp":1619813426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4419-0221-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781441902207","9781441902214"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-0221-4_10","relation":{},"ISSN":["1868-4238"],"issn-type":[{"type":"print","value":"1868-4238"}],"subject":[],"published":{"date-parts":[[2009]]}}}