{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T22:40:47Z","timestamp":1779230447635,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,7,23]],"date-time":"2010-07-23T00:00:00Z","timestamp":1279843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10107-010-0398-y","type":"journal-article","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T01:18:54Z","timestamp":1279761534000},"page":"277-294","source":"Crossref","is-referenced-by-count":7,"title":["Demand allocation with latency cost functions"],"prefix":"10.1007","volume":"132","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Grande","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Pacifici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,23]]},"reference":[{"issue":"5","key":"398_CR1","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1016\/j.cor.2008.02.013","volume":"36","author":"A. Agnetis","year":"2009","unstructured":"Agnetis A., Grande E., Mirchandani P.B., Pacifici A.: Covering a line segment with variable radius discs. Comput. Oper. Res. 36(5), 1423\u20131436 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"398_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"S. Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk S., Atamt\u00fcrk A., G\u00fcrel S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37(3), 187\u2013191 (2009)","journal-title":"Oper. Res. Lett."},{"key":"398_CR3","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann M., McGuire C.B., Winsten C.B.: Studies in the Economics of Transportation. Yale University Press, Yale (1956)"},{"key":"398_CR4","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/BF01918335","volume":"12","author":"D. Braess","year":"1969","unstructured":"Braess D.: \u00dcber ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12, 258\u2013268 (1969)","journal-title":"Unternehmensforschung"},{"key":"398_CR5","volume-title":"Traffic Congestion and the Environment: Issues of Efficiency and Social Feasibility","year":"1998","unstructured":"Button, K.J., Verhoef, E.T. (eds): Traffic Congestion and the Environment: Issues of Efficiency and Social Feasibility. Edward Elgar, Chcllenham (1998)"},{"key":"398_CR6","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S. Ceria","year":"1999","unstructured":"Ceria S., Soares J.: Convex programming for disjunctive convex optimization. Math. Programm. 86, 595\u2013614 (1999)","journal-title":"Math. Programm."},{"key":"398_CR7","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"issue":"2","key":"398_CR8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos S.C., Sparrow F.T.: The traffic assignment problem for a general network. J. Res. Nat. Bureau Stand. Ser. B 73((2), 91\u2013118 (1969)","journal-title":"J. Res. Nat. Bureau Stand. Ser. B"},{"issue":"2","key":"398_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A. Frangioni","year":"2006","unstructured":"Frangioni A., Gentile C.: Perspective cuts for 0\u20131 mixed integer programs. Math. Program. 106(2), 225\u2013236 (2006)","journal-title":"Math. Program."},{"key":"398_CR10","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective relaxation of MINLPs with indicator variables. In: Lodi A., Panconesi A., Rinaldi G. (eds.) Proceedings 13th IPCO Volume 5035 of Lecture Notes in Computer Science, pp. 1\u201316 (2008)"},{"key":"398_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty J.-B., Lemarchal C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)"},{"issue":"4","key":"398_CR12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1287\/trsc.1090.0287","volume":"43","author":"P. Maill\u00e9","year":"2009","unstructured":"Maill\u00e9 P., Stier-Moses N.: Eliciting coordination with Rebates. Transp. Sci. 43(4), 473\u2013492 (2009)","journal-title":"Transp. Sci."},{"key":"398_CR13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"A.R.C. Lemarechal","year":"2001","unstructured":"Lemarechal A.R.C.: A geometric study of duality gaps, with applications. Math. Program. Ser. A 90, 399\u2013427 (2001)","journal-title":"Math. Program. Ser. A"},{"key":"398_CR14","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou A.C.: The Economics of Welfare. Macmillan and Co, London (1920)"},{"key":"398_CR15","volume-title":"The Price of Anarchy and Selfish Routing","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden T.: The Price of Anarchy and Selfish Routing. MIT Press, Cambridge (2005)"},{"issue":"2","key":"398_CR16","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden T., T\u00e1rdos E.: How bad is selfish routing? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"4","key":"398_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0191-2615(79)90022-5","volume":"13","author":"M.J. Smith","year":"1979","unstructured":"Smith M.J.: The existence, uniqueness and stability of traffic equilibria. Trans. Res. Part B Methodol. 13(4), 295\u2013304 (1979)","journal-title":"Trans. Res. Part B Methodol."},{"key":"398_CR18","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings, Institute of Civil Engineers, vol. 1, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0398-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0398-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0398-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:19:42Z","timestamp":1559301582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0398-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,23]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["398"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0398-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,23]]}}}