{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T09:29:56Z","timestamp":1771666196960,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0167-6377(99)00059-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:26:40Z","timestamp":1027650400000},"page":"33-41","source":"Crossref","is-referenced-by-count":11,"title":["Simplicial with truncated Dantzig\u2013Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints"],"prefix":"10.1016","volume":"26","author":[{"given":"Siriphong","family":"Lawphongpanich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00059-0_BIB1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/trsc.13.4.292","article-title":"Methods for combining modal split and equilibrium assignment models","volume":"13","author":"Abdulaal","year":"1979","journal-title":"Transportation Sci."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB2","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB3","unstructured":"M.S. Bazaraa, H.D. Sherali, C.M. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley, New York, 1993."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB4","unstructured":"A. Brooke, D. Kendrick, A. Meeraus, GAMS: A User's Guide, Release 2.25, The Scientific Press, 1992."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230170307","article-title":"An efficient implementation of the PARTAN variant of the linear approximation method for the network equilibrium problem","volume":"17","author":"Florian","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB7","doi-asserted-by":"crossref","unstructured":"M. Florian, D.W. Hearn, Network equilibrium models and algorithms, in: M.O. Ball et al. (Eds.), Network Routing, Handbooks in OR and MS, Vol. 8, Elsevier Science, 1995, pp. 485\u2013550 (Chapter 6).","DOI":"10.1016\/S0927-0507(05)80110-0"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0191-2615(84)90029-8","article-title":"A modified Frank\u2013Wolfe algorithm for solving the traffic assignment problem","volume":"18B","author":"Fukushima","year":"1984","journal-title":"Transportation Res. B"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB9","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.20.3.282","article-title":"Nested decomposition and multi-stage linear programs","volume":"20","author":"Glassy","year":"1973","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02614381","article-title":"Solving nonlinear multicommodity flow problem by the analytic center cutting plane method","volume":"76","author":"Goffin","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB11","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/0191-2615(90)90037-Y","article-title":"A dual ascent algorithm for traffic assignment problems","volume":"24B","author":"Hearn","year":"1990","journal-title":"Transportation Res. B"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121181","article-title":"Restricted simplicial decomposition: computation and extensions","volume":"31","author":"Hearn","year":"1987","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB13","unstructured":"D.W. Hearn, J. Ribera, Bounded flow equilibrium problems by penalty methods, Proceedings of the IEEE International Conference on Circuits and Computers, 1980, pp. 162\u2013166."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01580231","article-title":"Nested decomposition for dynamic models","volume":"6","author":"Ho","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580219","article-title":"An extension of the Frank\u2013Wolfe method of feasible directions","volume":"6","author":"Holloway","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/mnsc.21.1.10","article-title":"On Rutenberg's decomposition method","volume":"21","author":"Hsia","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB17","unstructured":"J.L. Kennington, R.V. Helgason, Algorithms for Network Programming, Wiley, New York, 1980."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB18","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0191-2615(95)00016-7","article-title":"An augmented Lagrangian dual algorithm for link capacity side constrained traffic assignment problems","volume":"29","author":"Larsson","year":"1995","journal-title":"Transportation Res. B"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.26.1.4","article-title":"Simplicial decomposition with disaggregated representation for the traffic assignment problem","volume":"26","author":"Larsson","year":"1992","journal-title":"Transportation Sci."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB20","first-page":"97","article-title":"Restricted simplicial decomposition with application to the traffic assignment problem","volume":"38","author":"Lawphongpanich","year":"1986","journal-title":"Ricerca Operativa"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","article-title":"An efficient approach to solving the road network equilibrium traffic assignment problem","volume":"9","author":"LeBlanc","year":"1975","journal-title":"Transportation Res."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/net.3230260405","article-title":"Restricted simplicial decomposition with side constraints","volume":"26","author":"Marin","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB23","doi-asserted-by":"crossref","unstructured":"M.C. Pinar, S.A. Zenios, Solving nonlinear programs with embedded network structures, in: D.-Z. Du, P.M. Pardalos (Eds.), Network Optimization Problems, World Scientific Publishing, Co., Singapore, 1993, pp. 177\u2013202.","DOI":"10.1142\/9789812798190_0011"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB24","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.16.5.388","article-title":"Generalized networks, generalized upper bounding and decomposition of the convex simplex method","volume":"16","author":"Rutenberg","year":"1970","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB25","unstructured":"D. Stefek, Extensions of simplicial decomposition for solving the multicommodity flow problem with bounded arc flows and convex costs, Ph.D. Dissertation, Decision Sciences Department, University of Pennsylvania, 1988."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01584323","article-title":"Simplicial decomposition in nonlinear programming algorithms","volume":"13","author":"Von Hohenbalken","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00059-0_BIB27","unstructured":"R.J. Wittrock, Advances in a nested decomposition algorithm for solving staircase linear programs, Technical Report SOL 83-2, Department of Operations Research, Stanford University, 1983."},{"key":"10.1016\/S0167-6377(99)00059-0_BIB28","unstructured":"C.-H. Wu, J.A. Ventura, Restricted simplicial decomposition with side constraints and its application to capacitated multicommodity networks, IME Working Paper 94-128, Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, 1994."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000590?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000590?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T16:26:09Z","timestamp":1555259169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0167637799000590"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00059-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}