{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:21Z","timestamp":1740122421029,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:00:00Z","timestamp":1558396800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:00:00Z","timestamp":1558396800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10898-019-00750-9","type":"journal-article","created":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:12:11Z","timestamp":1558555931000},"page":"523-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9650-8746","authenticated-orcid":false,"given":"Shuvomoy","family":"Das Gupta","sequence":"first","affiliation":[]},{"given":"Lacra","family":"Pavel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,21]]},"reference":[{"key":"750_CR1","unstructured":"Gupta, S.D., Pavel, L.: Multi-player minimum cost flow problems with nonconvex costs and integer flows. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 7617\u20137622. IEEE (2016)"},{"key":"750_CR2","volume-title":"Electronic Commerce 2018: A Managerial and Social Networks Perspective","author":"E Turban","year":"2017","unstructured":"Turban, E., Outland, J., King, D., Lee, J.K., Liang, T.-P., Turban, D.C.: Electronic Commerce 2018: A Managerial and Social Networks Perspective. Springer, Berlin (2017)"},{"key":"750_CR3","volume-title":"The Four: The Hidden DNA of Amazon, Apple, Facebook, and Google","author":"S Galloway","year":"2017","unstructured":"Galloway, S.: The Four: The Hidden DNA of Amazon, Apple, Facebook, and Google. Portfolio, New York (2017)"},{"key":"750_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/9151","volume-title":"Managing Supply Chain and Logistics: Competitive Strategy for a Sustainable Future","author":"L Li","year":"2014","unstructured":"Li, L.: Managing Supply Chain and Logistics: Competitive Strategy for a Sustainable Future. World Scientific Publishing Co Inc, Singapore (2014)"},{"key":"750_CR5","doi-asserted-by":"crossref","unstructured":"Mendez, V.M., Monje, Jr, Carlos, A., White, V.: Beyond traffic: trends and choices 2045: a national dialogue about future transportation opportunities and challenges. In: Disrupting Mobility, pp. 3\u201320. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-51602-8_1"},{"key":"750_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/b11029","volume-title":"Internet Retail Operations: Integrating Theory and Practice for Managers","author":"TM Laseter","year":"2011","unstructured":"Laseter, T.M., Rabinovich, E.: Internet Retail Operations: Integrating Theory and Practice for Managers. CRC Press, Boca Raton (2011)"},{"key":"750_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"750_CR8","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"2012","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Springer, Berlin (2012)"},{"key":"750_CR9","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"issue":"5","key":"750_CR10","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1287\/opre.2013.1200","volume":"61","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Nasrabadi, E., Stiller, S.: Robust and adaptive network flows. Oper. Res. 61(5), 1218\u20131242 (2013)","journal-title":"Oper. Res."},{"issue":"6","key":"750_CR11","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1287\/opre.1100.0846","volume":"58","author":"B Vaidyanathan","year":"2010","unstructured":"Vaidyanathan, B., Ahuja, R.K.: Fast algorithms for specially structured minimum cost flow problems with applications. Oper. Res. 58(6), 1681\u20131696 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"750_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"TL Magnanti","year":"1984","unstructured":"Magnanti, T.L., Wong, R.T.: Network design and transportation planning: models and algorithms. Transp. Sci. 18(1), 1\u201355 (1984)","journal-title":"Transp. Sci."},{"issue":"1","key":"750_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230150107","volume":"15","author":"SC Graves","year":"1985","unstructured":"Graves, S.C., Orlin, J.B.: A minimum concave-cost dynamic network flow problem with an application to lot-sizing. Networks 15(1), 59\u201371 (1985)","journal-title":"Networks"},{"key":"750_CR14","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"MS Daskin","year":"2011","unstructured":"Daskin, M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, Hoboken (2011)"},{"key":"750_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59179-2_13","volume-title":"Network Methods for Head-Dependent Hydro Power Scheduling","author":"S Feltenmark","year":"1997","unstructured":"Feltenmark, S., Lindberg, P.O.: Network Methods for Head-Dependent Hydro Power Scheduling. Springer, Berlin (1997)"},{"issue":"2","key":"750_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.3230010205","volume":"1","author":"B Yaged","year":"1971","unstructured":"Yaged, B.: Minimum cost routing for static network models. Networks 1(2), 139\u2013172 (1971)","journal-title":"Networks"},{"issue":"1","key":"750_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10107-014-0752-6","volume":"150","author":"Q He","year":"2015","unstructured":"He, Q., Ahmed, S., Nemhauser, G.L.: Minimum concave cost flow over a grid network. Math. Program. 150(1), 79\u201398 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"750_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01096764","volume":"6","author":"H Tuy","year":"1995","unstructured":"Tuy, H., Ghannadan, S., Migdalas, A., V\u00e4rbrand, P.: The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs. J. Glob. Optim. 6(2), 135\u2013151 (1995)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"750_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10898-005-1658-x","volume":"34","author":"DBMM Fontes","year":"2006","unstructured":"Fontes, D.B.M.M., Hadjiconstantinou, E., Christofides, N.: A branch-and-bound algorithm for concave network flow problems. J. Glob. Optim. 34(1), 127\u2013155 (2006)","journal-title":"J. Glob. Optim."},{"issue":"7","key":"750_CR20","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"WI Zangwill","year":"1968","unstructured":"Zangwill, W.I.: Minimum concave cost flows in certain networks. Manag. Sci. 14(7), 429\u2013450 (1968)","journal-title":"Manag. Sci."},{"issue":"2","key":"750_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0305-0483(94)90075-2","volume":"22","author":"S Jorjani","year":"1994","unstructured":"Jorjani, S., Lamar, B.W.: Cash flow management network models with quantity discounting. Omega 22(2), 149\u2013155 (1994)","journal-title":"Omega"},{"issue":"2","key":"750_CR22","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/opre.1110.1025","volume":"60","author":"D Gamarnik","year":"2012","unstructured":"Gamarnik, D., Shah, D., Wei, Y.: Belief propagation for min-cost network flow: convergence and correctness. Oper. Res. 60(2), 410\u2013428 (2012)","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"750_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1026502220076","volume":"17","author":"D Kim","year":"2000","unstructured":"Kim, D., Pardalos, P.M.: A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems. J. Glob. Optim. 17(1\u20134), 225\u2013234 (2000)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"750_CR24","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10898-010-9548-2","volume":"49","author":"S Yan","year":"2011","unstructured":"Yan, S., Shih, Y.-L., Lee, W.-T.: A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems. J. Glob. Optim. 49(4), 539\u2013559 (2011)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"750_CR25","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1016\/j.cor.2008.06.008","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith, A., Ehrgott, M.: A two-phase algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 36(6), 1945\u20131954 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"750_CR26","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/0377-2217(93)90213-7","volume":"66","author":"H Lee","year":"1993","unstructured":"Lee, H., Pulat, P.S.: Bicriteria network flow problems: integer case. Eur. J. Oper. Res. 66(1), 148\u2013157 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"750_CR27","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1016\/j.cor.2008.11.001","volume":"36","author":"A Eus\u00e9bio","year":"2009","unstructured":"Eus\u00e9bio, A., Figueira, J.R.: Finding non-dominated solutions in bi-objective integer network flow problems. Comput. Oper. Res. 36(9), 2554\u20132564 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"750_CR28","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.tre.2011.03.001","volume":"47","author":"S Hern\u00e1ndez","year":"2011","unstructured":"Hern\u00e1ndez, S., Peeta, S., Kalafatas, G.: A less-than-truckload carrier collaboration planning problem under dynamic capacities. Transp. Res. Part E Logist. Transp. Rev. 47(6), 933\u2013946 (2011)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"750_CR29","doi-asserted-by":"crossref","unstructured":"Barnhart, C., Hane, C.A., Vance, P.H.: Integer multicommodity flow problems. In: Integer Programming and Combinatorial Optimization, pp. 58\u201371. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61310-2_5"},{"issue":"1","key":"750_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(99)00187-0","volume":"101","author":"L Brunetta","year":"2000","unstructured":"Brunetta, L., Conforti, M., Fischetti, M.: A polyhedral approach to an integer multicommodity flow problem. Discrete Appl. Math. 101(1), 13\u201336 (2000)","journal-title":"Discrete Appl. Math."},{"key":"750_CR31","doi-asserted-by":"crossref","unstructured":"Ozdaglar, A.E., Bertsekas, D.P.: Optimal solution of integer multicommodity flow problems with application in optical networks. In: Frontiers in global optimization, pp. 411\u2013435. Springer, Boston (2004)","DOI":"10.1007\/978-1-4613-0251-3_23"},{"key":"750_CR32","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization, vol. 6. Athena Scientific, Belmont (1997)"},{"key":"750_CR33","volume-title":"Dynamic Noncooperative Game Theory","author":"T Basar","year":"1995","unstructured":"Basar, T., Olsder, G.J.: Dynamic Noncooperative Game Theory, vol. 23. SIAM, Philadelphia (1995)"},{"key":"750_CR34","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1998)"},{"key":"750_CR35","volume-title":"Optimization Over Integers","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Weismantel, R.: Optimization Over Integers, vol. 13. Dynamic Ideas, Belmont (2005)"},{"issue":"3","key":"750_CR36","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"750_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms","author":"D Cox","year":"2007","unstructured":"Cox, D., Little, J., O\u2019shea, D.: Ideals, Varieties, and Algorithms, vol. 3. Springer, Berlin (2007)"},{"key":"750_CR38","series-title":"Athena Scientific Optimization and Computation Series","volume-title":"Convex Analysis and Optimization","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P., Ozdaglar, A.E., Nedic, A.: Convex Analysis and Optimization. Athena Scientific Optimization and Computation Series. Athena Scientific, Belmont (2003)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00750-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00750-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00750-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T23:09:41Z","timestamp":1589929781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00750-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,21]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["750"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00750-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,5,21]]},"assertion":[{"value":"10 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}