{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:12:52Z","timestamp":1759335172326,"version":"3.41.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational & Mathematical Organization Theory"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1009621108971","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T17:47:08Z","timestamp":1040579228000},"page":"29-45","source":"Crossref","is-referenced-by-count":16,"title":["Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models"],"prefix":"10.1007","volume":"6","author":[{"given":"Steven A.","family":"Gabriel","sequence":"first","affiliation":[]},{"given":"David","family":"Bernstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"260869_CR1","volume-title":"Network Flows Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., T.L. Magnanti and J.B. Orlin (1993), Network Flows Theory, Algorithms, and Applications. Prentice-Hall, New Jersey."},{"key":"260869_CR2","volume-title":"Nonlinear Programming Theory and Algorithms","author":"M.S. Bazaraa","year":"1979","unstructured":"Bazaraa, M.S. and C.M. Shetty (1979), Nonlinear Programming Theory and Algorithms. John Wiley & Sons, New York."},{"key":"260869_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D. and S.A. Gabriel (1997), \u201cSolving the Nonadditive Traffic Equilibrium Problem,\u201d in P.M. Pardalos, D.W. Hearn and W.W. Hager (Eds.,) Lecture Notes in Economics and Mathematical Systems Network Optimization Conference, pp. 72-102.","DOI":"10.1007\/978-3-642-59179-2_5"},{"key":"260869_CR4","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal, V. (1980), Linear Programming. W.H. Freeman and Company, New York."},{"key":"260869_CR5","doi-asserted-by":"crossref","unstructured":"Dial, R.B. (1979), \u201cA Model and Algorithm for Multicriteria Route-Mode Choice,\u201d Transportation Research, Col. 13B, 311-316.","DOI":"10.1016\/0191-2615(79)90024-9"},{"issue":"4","key":"260869_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1287\/trsc.31.4.337","volume":"31","author":"S.A. Gabriel","year":"1997","unstructured":"Gabriel, S.A. and D. Bernstein (1997), \u201cThe Traffic Equilibriuim Problem with Nonadditive Costs,\u201d Transportation Science, 31(4), 337\u2013348.","journal-title":"Transportation Science"},{"key":"260869_CR7","unstructured":"Garfinkel, R.S. and G.L. Nemhauser (1972), Integer Programming. Wiley-Intersciences."},{"key":"260869_CR8","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. Geoffrion","year":"1974","unstructured":"Geoffrion, A. (1974), \u201cLagrangian Relaxation for Integer Programming,\u201d Mathematical Programming Study, 2, 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"260869_CR9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G.Y. Handler","year":"1980","unstructured":"Handler, G.Y. and I. Zang (1980), \u201cA Dual Algorithm for the Constrained Shortest Path Problem,\u201d Networks, 10, 293\u2013310.","journal-title":"Networks"},{"key":"260869_CR10","unstructured":"Marathe, M. and R. Jacob (1998), Los Alamos National Laboratory, personal communication."},{"key":"260869_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0096-3003(93)90060-R","volume":"54","author":"P.B. Mirchandani","year":"1993","unstructured":"Mirchandani, P.B. and M.M. Wiecek (1993), \u201cRouting with Nonlinear Multiattribute Cost Functions,\u201d Applied Mathematics and Computation, 54, 215\u2013239.","journal-title":"Applied Mathematics and Computation"},{"key":"260869_CR12","unstructured":"Pang, J.S. (1998), personal communication."},{"key":"260869_CR13","unstructured":"Rockafellar, R.T. (1984), Network Flows and Monotropic Optimization. John Wiley & Sons."},{"key":"260869_CR14","unstructured":"Scott K. and D. Bernstein (1997), \u201cSolving a Best Path Problem When the Value of Time Function is Nonlinear,\u201d presented at the Annual Meeting of the Transportation Research Board, preprint 980976."},{"key":"260869_CR15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A.R. Warburton","year":"1987","unstructured":"Warburton, A.R. (1987), \u201cApproximation of Pareto Optima in Multiple-Objective Shortest-Path Problems,\u201d Operations Research, 35, 70\u201379.","journal-title":"Operations Research"}],"container-title":["Computational & Mathematical Organization Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009621108971.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009621108971\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009621108971.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:12:48Z","timestamp":1752376368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009621108971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["260869"],"URL":"https:\/\/doi.org\/10.1023\/a:1009621108971","relation":{},"ISSN":["1381-298X","1572-9346"],"issn-type":[{"type":"print","value":"1381-298X"},{"type":"electronic","value":"1572-9346"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}