{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T23:12:00Z","timestamp":1775862720435,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:00:00Z","timestamp":1401408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11590-014-0750-x","type":"journal-article","created":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T16:07:52Z","timestamp":1401379672000},"page":"41-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["A branch and cut algorithm for minimum spanning trees under conflict constraints"],"prefix":"10.1007","volume":"9","author":[{"given":"Phillippe","family":"Samer","sequence":"first","affiliation":[]},{"given":"Sebasti\u00e1n","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,30]]},"reference":[{"issue":"1","key":"750_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discret. Optim. 4(1), 4\u201320 (2007). doi: 10.1016\/j.disopt.2006.10.006","journal-title":"Discret. Optim."},{"issue":"1","key":"750_CR2","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.L., Savelsbergh, M.W.: Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1), 40\u201355 (2000). doi: 10.1016\/S0377-2217(99)00015-6","journal-title":"Eur. J. Oper. Res."},{"key":"750_CR3","doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive programming. In: 50 Years of Integer Programming 1958\u20132008, pp. 283\u2013340. Springer, Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-540-68279-0_10"},{"issue":"4","key":"750_CR4","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., Yu, C.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986). doi: 10.1137\/0215075","journal-title":"SIAM J. Comput."},{"key":"750_CR5","doi-asserted-by":"crossref","unstructured":"Darmann, A., Pferschy, U., Schauer, J.: Determining a minimum spanning tree with disjunctive constraints. In: Rossi, F., Tsoukias, A. (eds) Algorithmic Decision Theory, Lecture Notes in Computer Science, vol. 5783. Springer, Berlin Heidelberg, pp. 414\u2013423 (2009). doi: 10.1007\/978-3-642-04428-1_36 .","DOI":"10.1007\/978-3-642-04428-1_36"},{"issue":"16","key":"750_CR6","doi-asserted-by":"crossref","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16), 1726\u20131735 (2011). doi: 10.1016\/j.dam.2010.12.016","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"750_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","volume":"264","author":"B Dezs\u0151","year":"2011","unstructured":"Dezs\u0151, B., J\u00fcttner, A., Kov\u00e1cs, P.: LEMON\u2014an open source C++ graph template library. Electron. Notes Theor. Comput. Sci. 264(5), 23\u201345 (2011). doi: 10.1016\/j.entcs.2011.06.003","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"750_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127\u2013136 (1971). doi: 10.1007\/BF01584082","journal-title":"Math. Program."},{"key":"750_CR9","doi-asserted-by":"crossref","unstructured":"Gerards, A., Schrijver, A.: Matrices with the Edmonds-Johnson property. Combinatorica 6(4), 365\u2013379 (1986). doi: 10.1007\/BF02579262","DOI":"10.1007\/BF02579262"},{"issue":"4","key":"750_CR10","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988). doi: 10.1145\/48014.61051","journal-title":"J. ACM"},{"key":"750_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Berlin Heidelberg (1988)"},{"key":"750_CR12","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Wolsey, L.A.: Chapter 9 Optimal trees. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds) Network Models, Handbooks in Operations Research and Management Science, vol. 7. Elsevier, Amsterdam, pp. 503\u2013615 (1995)","DOI":"10.1016\/S0927-0507(05)80126-4"},{"issue":"4","key":"750_CR13","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1016\/j.cor.2012.10.022","volume":"40","author":"T \u00d6ncan","year":"2013","unstructured":"\u00d6ncan, T., Zhang, R., Punnen, A.P.: The minimum cost perfect matching problem with conflict pair constraints. Comput. Oper. Res. 40(4), 920\u2013930 (2013). doi: 10.1016\/j.cor.2012.10.022","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"750_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M Padberg","year":"1973","unstructured":"Padberg, M.: On the facial structure of set packing polyhedra. Math. Program. 5(1), 199\u2013215 (1973). doi: 10.1007\/BF01580121","journal-title":"Math. Program."},{"key":"750_CR15","doi-asserted-by":"crossref","unstructured":"Padberg, M.W.: Covering, packing and knapsack problems. In: Hammer, P.L., Johnson, E.L., Korte, B.H. (eds.) Annals of Discrete Mathematics, vol. 4. Elsevier, Amsterdam, pp 265\u2013287 (1979)","DOI":"10.1016\/S0167-5060(08)70831-8"},{"issue":"2","key":"750_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algortihms Appl. 13(2), 233\u2013249 (2009). doi: 10.7155\/jgaa.00186","journal-title":"J. Graph Algortihms Appl."},{"key":"750_CR17","doi-asserted-by":"crossref","unstructured":"Pferschy, U., Schauer, J.: The maximum flow problem with disjunctive constraints. J. Comb. Optim. 26, 109\u2013119 (2011). doi: 10.1007\/s10878-011-9438-7","DOI":"10.1007\/s10878-011-9438-7"},{"issue":"2","key":"750_CR18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/nav.20446","volume":"58","author":"AP Punnen","year":"2011","unstructured":"Punnen, A.P., Zhang, R.: Quadratic bottleneck problems. Naval Res. Logist. (NRL) 58(2), 153\u2013164 (2011). doi: 10.1002\/nav.20446","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"1\u20132","key":"750_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1111\/j.1475-3995.2011.00805.x","volume":"19","author":"S Rebennack","year":"2012","unstructured":"Rebennack, S., Reinelt, G., Pardalos, P.M.: A tutorial on branch and cut algorithms for the maximum stable set problem. Int. Trans. Oper. Res. 19(1\u20132), 161\u2013199 (2012). doi: 10.1111\/j.1475-3995.2011.00805.x","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"750_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0167-6377(00)00060-2","volume":"28","author":"F Rossi","year":"2001","unstructured":"Rossi, F., Smriglio, S.: A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper. Res. Lett. 28(2), 63\u201374 (2001). doi: 10.1016\/S0167-6377(00)00060-2","journal-title":"Oper. Res. Lett."},{"key":"750_CR21","doi-asserted-by":"crossref","unstructured":"Sadykov, R., Vanderbeck, F.: Bin packing with conflicts: a generic branch-and-price algorithm. INFORMS J. Comput. (2012). doi: 10.1287\/ijoc.1120.0499","DOI":"10.1287\/ijoc.1120.0499"},{"issue":"1","key":"750_CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006). doi: 10.1016\/j.tcs.2006.06.015","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"750_CR23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.disopt.2010.08.001","volume":"8","author":"R Zhang","year":"2011","unstructured":"Zhang, R., Kabadi, S.N., Punnen, A.P.: The minimum spanning tree problem with conflict constraints and its variations. Discret. Optim. 8(2), 191\u2013205 (2011). doi: 10.1016\/j.disopt.2010.08.001","journal-title":"Discret. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0750-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0750-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0750-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T03:49:25Z","timestamp":1565495365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0750-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,30]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["750"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0750-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,30]]}}}