{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:11:14Z","timestamp":1780441874042,"version":"3.54.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319070452","type":"print"},{"value":"9783319070469","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07046-9_4","type":"book-chapter","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T02:07:28Z","timestamp":1399860448000},"page":"45-54","source":"Crossref","is-referenced-by-count":2,"title":["Solving the Quorumcast Routing Problem as a Mixed Integer Program"],"prefix":"10.1007","author":[{"given":"Quoc Trung","family":"Bui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quang Dung","family":"Pham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River (1993)"},{"key":"4_CR2","first-page":"99","volume":"44","author":"J.-F. Cordeau","year":"2006","unstructured":"Cordeau, J.-F., Costa, A.M., Laporte, G.: Steiner tree problems with profits. INFOR\u00a044, 99\u2013115 (2006)","journal-title":"INFOR"},{"issue":"12","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/S0305-0548(96)00026-3","volume":"23","author":"K.A. Andersen","year":"1996","unstructured":"Andersen, K.A., Jrnsten, K., Lind, M.: On bicriterion minimal spanning trees: An approximation. Computers and amp; Operations Research\u00a023(12), 1171\u20131182 (1996)","journal-title":"Computers and amp; Operations Research"},{"key":"4_CR4","series-title":"Princeton Series in Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D.L. Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2007)"},{"key":"4_CR5","unstructured":"Cheung, S.Y., Kumar, A.: Efficient quorumcast routing algorithms. In: Proceedings IEEE INFOCOM 1994, Networking For Global Communications, vol.\u00a02, pp. 840\u2013847 (June 1994)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Chimani, M., Kandyba, M., Ljubi\u0107, I., Mutzel, P.: Obtaining optimal k-cardinality trees fast. J. Exp. Algorithmics\u00a014, 5:2.5\u20135:2.23(2010)","DOI":"10.1145\/1498698.1537600"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Chopra, S., Tsai, C.Y.: Polyhedral approaches for the steiner tree problem on graphs. In: Du, D.-Z., Cheng, X. (eds.) Steiner Trees in Industries, vol.\u00a011, pp. 175\u2013202. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4613-0255-1_5"},{"key":"4_CR8","unstructured":"Comet. Comet user manual, dynadec (2011), http:\/\/dynadec.com\/"},{"key":"4_CR9","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Requejo, A.C.C., Agra, A., Santos, E.: Formulations for the weightconstrained minimum spanning tree problem. In: AIP Conf. Proc. vol.\u00a01281, pp. 2166\u20132169 (2010)","DOI":"10.1063\/1.3498397"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Drexl, M., Irnich, S.: Solving elementary shortest-path problems as mixed-integer programs. OR Spectrum, pp. 1\u201316 (2012)","DOI":"10.1007\/s00291-012-0302-7"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Du, B., Gu, J., Tsang, D.H.K., Wang, W.: Quorumcast routing by multispace search. In: Global Telecommunications Conference on Communications: The Key to Global Prosperity, GLOBECOM 1996, vol.\u00a02, pp. 1069\u20131073 (November 1996)","DOI":"10.1109\/GLOCOM.1996.587595"},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1002\/net.20001","volume":"43","author":"T. Fujie","year":"2004","unstructured":"Fujie, T.: The maximum-leaf spanning tree problem: Formulations and facets. Networks\u00a043(4), 212\u2013223 (2004)","journal-title":"Networks"},{"key":"4_CR14","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"M.X. Goemans","year":"1993","unstructured":"Goemans, M.X., Myung, Y.-S.: A catalog of steiner tree formulations. Networks\u00a023(1), 19\u201328 (1993)","journal-title":"Networks"},{"key":"4_CR16","unstructured":"S.T. Henn.: Weight-Constrained Minimum Spanning Tree Problem. PhD thesis, University of Kaiserslautern (2007)"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1111\/j.1475-3995.2008.00681.x","volume":"16","author":"M.S. Ibrahim","year":"2009","unstructured":"Ibrahim, M.S., Maculan, N., Minoux, M.: A strong flow-based formulation for the shortest path problem in digraphs with negative cycles. International Transactions in Operational Research\u00a016(3), 361\u2013369 (2009)","journal-title":"International Transactions in Operational Research"},{"key":"4_CR18","unstructured":"Wayne, K.: Union-find algorithms. (2008), http:\/\/www.cs.princeton.edu\/r~s\/AlgsDS07\/01UnionFind.pdf"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T., Martin, A.: Solving steiner tree problems in graphs to optimality. Networks\u00a032, 207\u2013232 (1998)","journal-title":"Networks"},{"key":"4_CR20","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An updated library on steiner tree problems in graphs. Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, Berlin (2000)"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0377-2217(85)90284-X","volume":"20","author":"R.V. Kulkarni","year":"1985","unstructured":"Kulkarni, R.V., Bhave, P.R.: Integer programming formulations of vehicle routing problems. European Journal of Operational Research\u00a020(1), 58\u201367 (1985)","journal-title":"European Journal of Operational Research"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubi","year":"2006","unstructured":"Ljubi, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting steiner tree problem. Mathematical Programming\u00a0105, 427\u2013449 (2006)","journal-title":"Mathematical Programming"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Ljubi, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting steiner tree problem. In: Mathematical Progamming. Series B (2006)","DOI":"10.1007\/s10107-005-0660-x"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(98)00033-7","volume":"66","author":"C.P. Low","year":"1998","unstructured":"Low, C.P.: A fast search algorithm for the quorumcast routing problem. Inf. Process. Lett.\u00a066(2), 87\u201392 (1998)","journal-title":"Inf. Process. Lett."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-L","volume":"31","author":"A. Lucena","year":"1998","unstructured":"Lucena, A., Beasley, J.E.: A branch and cut algorithm for the steiner problem in graphs. Networks\u00a031, 39\u201359 (1998)","journal-title":"Networks"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10287-009-0116-5","volume":"7","author":"A. Lucena","year":"2010","unstructured":"Lucena, A., Maculan, N., Simonetti, L.: Reformulations and solution algorithms for the maximum leaf spanning tree problem. Computational Management Science\u00a07, 289\u2013311 (2010)","journal-title":"Computational Management Science"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Monma, C.L., Ball, M.O., Magnanti, T.L., Nemhauser, G.L. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol.\u00a07, ch. 9, pp. 503\u2013615. Elsevier (1995)","DOI":"10.1016\/S0927-0507(05)80126-4"},{"issue":"4","key":"4_CR28","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C.E. Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM\u00a07(4), 326\u2013329 (1960)","journal-title":"J. ACM"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10601-012-9125-z","volume":"17","author":"Q. Pham","year":"2012","unstructured":"Pham, Q., Deville, Y.: Solving the quorumcast routing problem by constraint programming. Constraints\u00a017, 409\u2013431 (2012)","journal-title":"Constraints"},{"key":"4_CR30","unstructured":"G. Skorobohatyj.: Finding a minimum cut between all pairs of nodes in an undirected graph (2008), http:\/\/elib.zib.de\/pub\/Packages\/mathprog\/mincut\/all-pairs\/index.html"},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.orl.2005.02.007","volume":"34","author":"E. Uchoa","year":"2006","unstructured":"Uchoa, E.: Reduction tests for the prize-collecting steiner problem. Operations Research Letters\u00a034(4), 437\u2013444 (2006)","journal-title":"Operations Research Letters"},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S1389-1286(03)00322-0","volume":"44","author":"B. Wang","year":"2004","unstructured":"Wang, B., Hou, J.C.: An efficient QoS routing algorithm for quorumcast communication. Computer Networks Journal\u00a044(1), 43\u201361 (2004)","journal-title":"Computer Networks Journal"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07046-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T21:47:18Z","timestamp":1746222438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07046-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070452","9783319070469"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07046-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}