{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T11:19:26Z","timestamp":1780399166929,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819200733","type":"print"},{"value":"9789819200740","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0074-0_3","type":"book-chapter","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:54:10Z","timestamp":1780397650000},"page":"34-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Mixed-Integer Linear Programming Formulations with\u00a0Redundant Variables for\u00a0Elementary Shortest Path and\u00a0Quorumcast Routing Problems"],"prefix":"10.1007","author":[{"given":"Bui","family":"Quoc Trung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pham","family":"Quang Dung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Amaldi, E., Coniglio, S., Taccari, L.: Maximum throughput network routing subject to fair flow allocation. In: International Symposium on Combinatorial Optimization, pp. 1\u201312. Springer (2014)","DOI":"10.1007\/978-3-319-09174-7_1"},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bui, Q.T., Deville, Y., Pham, Q.D.: Exact methods for solving the elementary shortest and longest path problems. Annal. Operat. Res. 244(2), 313\u2013348 (2016)","DOI":"10.1007\/s10479-016-2116-5"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bui, Q.T., Pham, Q.D., Deville, Y.: Solving the Quorumcast routing problem as a mixed integer program. In: Simonis,h., (ed.), Integration of AI and OR Techniques in Constraint Programming, vol. 8451, LNCS, pp. 45\u201354. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-07046-9_4"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Shun\u00a0Yan Cheung and A.\u00a0Kumar. Efficient quorumcast routing algorithms. In INFOCOM \u201994. Networking for Global Communications., 13th Proceedings IEEE, pages 840 \u2013847 vol.2, jun 1994","DOI":"10.1109\/INFCOM.1994.337654"},{"key":"3_CR6","unstructured":"Cheung, S.Y., Kumar, A.: Efficient Quorumcast routing algorithms. In: INFOCOM \u201994. Networking for Global Communications, 13th Proceedings IEEE, vol. 2, pp. 840 \u2013847 (1994)"},{"key":"3_CR7","unstructured":"Cormen, C T.H., Leiserson, H.T., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition . The MIT Press, 3rd Edition (2009)"},{"key":"3_CR8","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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Du, B., Gu, J., Tsang, D.H.K., Wang,W.: Quorumcast routing by multispace search. In: Global Telecommunications Conference, 1996. GLOBECOM \u201996. \u2019Communications: The Key to Global Prosperity, vol. 2, pp. 1069 \u20131073 (1996)","DOI":"10.1109\/GLOCOM.1996.587595"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, .: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Netw. Int. J. 44(3), 216\u2013229 (2004)","DOI":"10.1002\/net.20033"},{"key":"3_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. In: Freeman, W. H., (ed.) & Co., New York, NY, USA (1990)"},{"key":"3_CR12","unstructured":"IBM. IBM ILOG CPLEX V12.1 User\u2019s Manual for CPLEX (2009)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1111\/j.1475-3995.2008.00681.x","volume":"16","author":"M Minoux","year":"2009","unstructured":"Minoux, M., Ibrahim, M., Maculan, N.: A strong flow-based formulation for the shortest path problem in digraphs with negative cycles. Int. Trans. Oper. Res. 16, 361\u2013369 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"3_CR14","unstructured":"Jepsen, M.K., Petersen, B., Spoorendonk, S.: A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint . DIKU (2008)"},{"key":"3_CR15","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":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(98)00033-7","volume":"66","author":"Chor Ping Low","year":"1998","unstructured":"Chor Ping Low: A fast search algorithm for the Quorumcast routing problem. Inf. Process. Lett. 66(2), 87\u201392 (1998)","journal-title":"Inf. Process. Lett."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10601-012-9125-z","volume":"17","author":"QD Pham","year":"2012","unstructured":"Pham, Q.D., Deville, Y.: Solving the Quorumcast routing problem by constraint programming. Constraints 17, 409\u2013431 (2012)","journal-title":"Constraints"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini, G., Salani, M.: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 3(3), 255\u2013273 (2006)","journal-title":"Discret. Optim."},{"key":"3_CR19","unstructured":"Skorobohatyj, G.: Finding a minimum cut between all pairs of nodes in an undirected graph. http:\/\/elib.zib.de\/pub\/Packages\/mathprog\/mincut\/all-pairs\/index.html (1999)"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ejor.2016.01.003","volume":"252","author":"L Taccari","year":"2016","unstructured":"Taccari, L.: Integer programming formulations for the elementary shortest path problem. Eur. J. Oper. Res. 252(1), 122\u2013130 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1\u201310 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"3_CR22","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. Comput. Netw. J. 44(1), 43\u201361 (2004)","journal-title":"Comput. Netw. J."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Wang, B., Hou, J.C.: An efficient QoS routing algorithm for Quorumcast communication. Comput. Netw. 44(1), 43\u201361 (2004)","DOI":"10.1016\/S1389-1286(03)00322-0"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0074-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:54:16Z","timestamp":1780397656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0074-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819200733","9789819200740"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0074-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaohsiung","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}