{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:04:48Z","timestamp":1757311488501},"reference-count":38,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1051\/ro:2006010","type":"journal-article","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T16:22:30Z","timestamp":1151684550000},"page":"53-73","source":"Crossref","is-referenced-by-count":10,"title":["Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut"],"prefix":"10.1051","volume":"40","author":[{"given":"Francisco","family":"Barahona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"Lad\u00e1nyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2006,7,1]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"20","author":"Aneja","year":"1980","journal-title":"Networks"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"D. Applegate, R. Bixby, V. Chv\u00e1tal and W. Cook, On the solution of traveling salesman problems, inProc. of the International Congress of MathematiciansIII(1998) 645\u2013656.","DOI":"10.4171\/dms\/1-3\/62"},{"key":"R3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1027368621279","volume":"7","author":"Bahiense","year":"2003","journal-title":"J. Comb. Optim."},{"key":"R4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-002-0357-3","volume":"94","author":"Bahiense","year":"2002","journal-title":"Math. Program."},{"key":"R5","doi-asserted-by":"crossref","first-page":"2864","DOI":"10.1103\/PhysRevB.49.12864","volume":"49","author":"Barahona","year":"1994","journal-title":"Phys. Rev. B"},{"key":"R6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"Barahona","year":"2000","journal-title":"Math. Program."},{"key":"R7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(01)00252-9","volume":"118","author":"Barahona","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"R8","unstructured":"F. Barahona, M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt. An application of combinatorial optimization to statistical physics and circuit layout design,Oper. Res.36(1988) 493\u2013513."},{"key":"R9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"Barahona","year":"1989","journal-title":"Math. Program."},{"key":"R10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"Barahona","year":"1986","journal-title":"Math. Program."},{"key":"R11","unstructured":"A. Caprara and M. Fischetti,Branch-and-cut algorithms, in Annotated Bibliographies in Combinatorial Optimization, edited by M.D. Amico, F. Maffioli and S. Martello, Wiley (1997) 45\u201363."},{"key":"R12","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.4.3.320","volume":"4","author":"Chopra","year":"1992","journal-title":"ORSA J. Comput."},{"key":"R13","unstructured":"COIN-OR, http:www.coin-or.org."},{"key":"R14","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"De Simone","year":"1995","journal-title":"J. Stat. Phys."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"C. De Simone, M. Diehl, M. J\u00fcnger, P. Mutzel, G. Reinelt and G. Rinaldi, Exact ground states of two-dimensional +\u2013J Ising spin glasses.J. Stat. Phys.(1996).","DOI":"10.1007\/BF02174135"},{"key":"R16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/10556789408805564","volume":"3","author":"De Simone","year":"1994","journal-title":"Optim. Method. Softw."},{"key":"R17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"Edmonds","year":"1967","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"R18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02085641","volume":"50","author":"Escudero","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"R19","unstructured":"J.J. Forrest, The COIN-OR Linear Program Solver (CLP), INFORMS Atlanta, (2003)."},{"key":"R20","unstructured":"A. Frangioni, A. Lodi and G. Rinaldi, Optimizing over semimetric polytopes, in Integer programming and combinatorial optimization, Springer, BerlinLect. Notes Comput. Sci.3064(2004) 431\u2013443."},{"key":"R21","unstructured":"M.X. Goemans and Y.S. Myung, A catalog of Steiner tree formulations,Networks23(1993), pp. 19\u201328."},{"key":"R22","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/S0377-2217(97)00034-9","volume":"105","author":"Guignard","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"Held","year":"1971","journal-title":"Math. Program."},{"key":"R25","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"Held","year":"1974","journal-title":"Math. Program."},{"key":"R26","first-page":"291","volume":"82","author":"Helmberg","year":"1998","journal-title":"Math. Program."},{"key":"R27","unstructured":"T. Koch and A. Martin,Steinlib, http:\/\/elib.zib.de\/steinlib\/steinlib.php."},{"key":"R28","doi-asserted-by":"crossref","unstructured":"T. Koch and A. Martin, Solving Steiner tree problems in graphs to optimality, Networks32(1998) 207\u2013232.","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"C. Lemar\u00e9chal, Nondifferentiable optimization, inOptimization, Hanbooks Oper. Res., edited by G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, North Holland, 1989, pp. 529\u2013572.","DOI":"10.1016\/S0927-0507(89)01008-X"},{"key":"R30","unstructured":"A. Lucena,Steiner problem in graphs: Lagrangian relaxation and cutting-planes,COAL Bull.21(1992) 2\u20137."},{"key":"R31","unstructured":"A. Lucena, Tight bounds for the Steiner problem in graphs, inProc. Netflow93(1993) 147\u2013154."},{"key":"R32","unstructured":"A. Lucena. and J. Beasley, A branch-and-cut algorithm for the Steiner problem in graphs.Networks31(1998), pp. 39\u201359."},{"key":"R33","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1137\/S1052623497324242","volume":"10","author":"Mitchell","year":"2000","journal-title":"SIAM J. Optim."},{"key":"R34","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Rev."},{"key":"R35","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"Polzin","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"R36","unstructured":"H. Takahashi and A. Matsuyama, An approximated solution for the Steiner tree problem in graphs,Math. Japonica254(1980) 573\u2013577."},{"key":"R37","doi-asserted-by":"crossref","unstructured":"E. Uchoa, M. Poggi de Arag\u00e3o and C.C. Ribeiro, Preprocessing Steiner problems from VLSI layout,Networks40(2002) 38\u201350.","DOI":"10.1002\/net.10035"},{"key":"R38","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","volume":"3","author":"Wolfe","year":"1975","journal-title":"Math. Program. Study"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2006010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T21:50:05Z","timestamp":1683496205000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2006010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":38,"journal-issue":{"issue":"1"},"alternative-id":["ro0534"],"URL":"https:\/\/doi.org\/10.1051\/ro:2006010","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1]]}}}