{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:04:17Z","timestamp":1743113057207,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":24,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_614","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:08:03Z","timestamp":1219662483000},"page":"3575-3579","source":"Crossref","is-referenced-by-count":0,"title":["Simplicial Decomposition"],"prefix":"10.1007","author":[{"given":"Siriphong","family":"Lawphongpanich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"614_CR1_614","volume-title":"Network flows: Theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"614_CR2_614","volume-title":"Nonlinear programming: Theory and algorithms","author":"M.S. Bazaraa","year":"1993","unstructured":"Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: Theory and algorithms. Wiley, New York"},{"key":"614_CR3_614","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"D.P. Bertsekas","year":"1982","unstructured":"Bertsekas DP (1982) Projected Newton methods for optimization problems with simple constraints. SIAM J Control Optim 20:221\u2013246","journal-title":"SIAM J. Control Optim."},{"key":"614_CR4_614","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1109\/T-C.1974.223806","volume":"c-23","author":"D.G. Cantor","year":"1974","unstructured":"Cantor DG, Gerla M (1974) Optimal routing in a\u00a0packet switched network. IEEE Trans Computers c-23:1062\u20131069","journal-title":"IEEE Trans. Computers"},{"key":"614_CR5_614","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8:101\u2013111","journal-title":"Oper. Res."},{"key":"614_CR6_614","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Quart 3:95\u2013110","journal-title":"Naval Res. Logist. Quart."},{"key":"614_CR7_614","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/mnsc.16.11.652","volume":"16","author":"A.M. Geoffrion","year":"1970","unstructured":"Geoffrion AM (1970) Elements of large-scale mathematical programming. Managem Sci 16:652\u2013691","journal-title":"Managem. Sci."},{"key":"614_CR8_614","unstructured":"Gerla M (1973) The design of store-and-forward (S\/F) networks for computer communications. PhD Thesis Dept Computer Sci Univ Calif, Los Angeles"},{"key":"614_CR9_614","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0167-6377(85)90016-1","volume":"4","author":"D.W. Hearn","year":"1985","unstructured":"Hearn DW, Lawphongpanich S, Ventura JA (1985) Finiteness in restricted simplicial decomposition. Oper Res Lett 4:125\u2013130","journal-title":"Oper. Res. Lett."},{"key":"614_CR10_614","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121181","volume":"31","author":"D.W. Hearn","year":"1987","unstructured":"Hearn DW, Lawphongpanich S, Ventura JA (1987) Restricted simplicial decompsition: Computation and extension. Math Program 31:99\u2013118","journal-title":"Math. Program."},{"key":"614_CR11_614","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580219","volume":"6","author":"C. Holloway","year":"1974","unstructured":"Holloway C (1974) An extension of the Frank\u2013Wolfe method of feasible directions. Math Program 6:14\u201327","journal-title":"Math. Program."},{"key":"614_CR12_614","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/trsc.26.1.4","volume":"26","author":"T. Larsson","year":"1992","unstructured":"Larsson T, Patriksson M (1992) Simplicial decomposition with disaggregate representation for the traffic assignment problem. Transport Sci 26:4\u201317","journal-title":"Transport. Sci."},{"key":"614_CR13_614","series-title":"Lecture Notes Economics and Math. Systems","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/978-3-642-59179-2_17","volume-title":"Network Optimization","author":"T. Larsson","year":"1997","unstructured":"Larsson T, Patriksson M, Rydergren C (1997) Applications of simplicial decomposition with nonlinear column generations to nonlinear network flows. In: Pardalos PM, Hearn DW, Hager WH (eds) Network Optimization. Lecture Notes Economics & Math Systems. Springer, Berlin, pp 346\u2013373"},{"key":"614_CR14_614","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0167-6377(99)00059-0","volume":"26","author":"S. Lawphongpanich","year":"2000","unstructured":"Lawphongpanich S (2000) Simplicial with truncated Dantzig\u2013Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints. Oper Res Lett 26:33\u201341","journal-title":"Oper. Res. Lett."},{"key":"614_CR15_614","first-page":"97","volume":"38","author":"S. Lawphongpanich","year":"1986","unstructured":"Lawphongpanich S, Hearn DW (1986) Restricted simplicial decomposition with applications to the traffic assignment problem. Ricerca Oper 38:97\u2013120","journal-title":"Ricerca Oper."},{"key":"614_CR16_614","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01581701","volume":"65","author":"A. Migdalas","year":"1994","unstructured":"Migdalas A (1994) A\u00a0regularization of the Frank\u2013Wolfe method and unification of certain nonlinear programming method. Math Program 65:331\u2013346","journal-title":"Math. Program."},{"key":"614_CR17_614","first-page":"359","volume":"11","author":"J. Mulvey","year":"1990","unstructured":"Mulvey J, Zenios SA, Ahlfeld DP (1990) Simplicial decomposition for convex generalized networks. J\u00a0Inform Optim Sci 11:359\u2013387","journal-title":"J. Inform. Optim. Sci."},{"key":"614_CR18_614","first-page":"145","volume-title":"Proc. Math. Models in the Social Sci.","author":"J.D. Murchland","year":"1970","unstructured":"Murchland JD (1970) Road network traffic distribution in equilibrium. In: Henn R, K\u00fcnzi HP, Schubert H (eds) Proc. Math. Models in the Social Sci. Anton Hain Verlag, Meisenheim, pp 145\u2013183"},{"key":"614_CR19_614","first-page":"203","volume-title":"Network Optimization Problems","author":"W.B. Powell","year":"1993","unstructured":"Powell WB (1993) On algorithms for nonlinear dynamic networks. In: Du D-Z, Pardalos PM (eds) Network Optimization Problems. World Sci., Singapore, pp 203\u2013231"},{"key":"614_CR20_614","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton Univ. Press, Princeton"},{"key":"614_CR21_614","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01581238","volume":"59","author":"J.A. Ventura","year":"1993","unstructured":"Ventura JA, Hearn DW (1993) Restricted simplicial decomposition for convex constrained problems. Math Program 59:71\u201385","journal-title":"Math. Program."},{"key":"614_CR22_614","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01681343","volume":"8","author":"B. Von Hohenbalken","year":"1975","unstructured":"Von Hohenbalken B (1975) A\u00a0finite algorithm to maximize certain pseudo-concave function on polytopes. Math Program 8:189\u2013206","journal-title":"Math. Program."},{"key":"614_CR23_614","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01584323","volume":"13","author":"B. Von Hohenbalken","year":"1977","unstructured":"Von Hohenbalken B (1977) Simplicial decomposition in nonlinear programming algorithms. Math Program 13:49\u201368","journal-title":"Math. Program."},{"key":"614_CR24_614","unstructured":"Wu C-H, Ventura JA (1994) Restricted simplicial decomposition with side constraints and its application to capacitated multicommodity networks. In: IME Working Paper Dept. Industr. and Management Systems Engin., Penn. State Univ., vol\u00a094-128"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:39:41Z","timestamp":1720694381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_614","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}