{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T17:42:31Z","timestamp":1751996551828,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"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_49","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:06:22Z","timestamp":1219662382000},"page":"282-288","source":"Crossref","is-referenced-by-count":6,"title":["Bilinear Programming: Applications in the Supply Chain Management"],"prefix":"10.1007","author":[{"given":"Artyom G.","family":"Nahapetyan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1_49","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","volume":"29","author":"R Barr","year":"1981","unstructured":"Barr R, Glover F, Klingman D (1981) A\u00a0New\nOptimization Method for Large Scale Fixed Charge Transportation\nProblems. Oper Res 29:448\u2013463","journal-title":"Oper Res"},{"key":"49_CR2_49","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"A Cabot","year":"1984","unstructured":"Cabot A, Erenguc S (1984) Some Branch-and-Bound\nProcedures for Fixed-Cost Transportation Problems. Nav Res\nLogist Q 31:145\u2013154","journal-title":"Nav Res Logist Q"},{"key":"49_CR3_49","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/nav.3800140110","volume":"14","author":"L Cooper","year":"1967","unstructured":"Cooper L, Drebes C (1967) An Approximate Solution\nMethod for the Fixed Charge Problem. Nav Res Logist Q 14:101\u2013113","journal-title":"Nav Res Logist Q"},{"key":"49_CR4_49","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1038\/sj\/jors\/0421107","volume":"42","author":"M Diaby","year":"1991","unstructured":"Diaby M (1991) Successive Linear Approximation\nProcedure for Generalized Fixed-Charge Transportation Problem.\nJ\u00a0Oper Res Soc 42:991\u20131001","journal-title":"J Oper Res Soc"},{"key":"49_CR5_49","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P Gray","year":"1971","unstructured":"Gray P (1971) Exact Solution for the Fixed-Charge\nTransportation Problem. Oper Res 19:1529\u20131538","journal-title":"Oper Res"},{"key":"49_CR6_49","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G Guisewite","year":"1990","unstructured":"Guisewite G, Pardalos P (1990) Minimum concave-cost network flow problems:\napplications, complexity, and algorithms. Ann Oper\nRes 25:75\u2013100","journal-title":"Ann Oper Res"},{"key":"49_CR7_49","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","volume":"22","author":"J Kennington","year":"1976","unstructured":"Kennington J, Unger V (1976) A\u00a0New\nBranch-and-Bound Algorithm for the Fixed Charge Transportation\nProblem. Manag Sci 22:1116\u20131126","journal-title":"Manag Sci"},{"key":"49_CR8_49","doi-asserted-by":"crossref","unstructured":"Khang D, Fujiwara O (1991) Approximate Solution of\nCapacitated Fixed-Charge Minimum Cost Network Flow Problems.\nNetw 21:689\u2013704","DOI":"10.1002\/net.3230210606"},{"key":"49_CR9_49","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D Kim","year":"1999","unstructured":"Kim D, Pardalos P (1999) A\u00a0Solution Approach to the Fixed Charge\nNetwork Flow Problem Using a\u00a0Dynamic Slope Scaling Procedure.\nOper Res Lett 24:195\u2013203","journal-title":"Oper Res Lett"},{"key":"49_CR10_49","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","volume":"35","author":"D Kim","year":"2000","unstructured":"Kim D, Pardalos P (2000) Dynamic Slope Scaling and\nTrust Interval Techniques for Solving Concave Piecewise Linear\nNetwork Flow Problems. Netw 35:216\u2013222","journal-title":"Netw"},{"key":"49_CR11_49","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H Konno","year":"1976","unstructured":"Konno H (1976) A\u00a0Cutting Plane Algorithm for Solving\nBilinear Programs. Math Program 11:14\u201327","journal-title":"Math Program"},{"key":"49_CR12_49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/nav.3800090102","volume":"9","author":"H Kuhn","year":"1962","unstructured":"Kuhn H, Baumol W (1962) An Approximate Algorithm\nfor the Fixed Charge Transportation Problem. Nav Res\nLogist Q 9:1\u201315","journal-title":"Nav Res Logist Q"},{"key":"49_CR13_49","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3934\/jimo.2007.3.71","volume":"3","author":"A Nahapetyan","year":"2007","unstructured":"Nahapetyan A, Pardalos P (2007) A\u00a0Bilinear\nRelaxation Based Algorithm for Concave Piecewise Linear Network\nFlow Problems. J\u00a0Ind Manag Optim 3:71\u201385","journal-title":"J Ind Manag Optim"},{"key":"49_CR14_49","doi-asserted-by":"crossref","unstructured":"Nahapetyan A, Pardalos P (2008) Adaptive Dynamic Cost Updating Procedure\nfor Solving Fixed Charge Network Flow Problems. Comput Optim Appl 39:37\u201350. doi:10.1007\/s10589-007-9060-x","DOI":"10.1007\/s10589-007-9060-x"},{"key":"49_CR15_49","doi-asserted-by":"crossref","unstructured":"Nahapetyan A, Pardalos P (2008) A\u00a0Bilinear Reduction\nBased Algorithm for Solving Capacitated Multi-Item Dynamic Pricing\nProblems. Comput Oper Res J 35:1601\u20131612. doi:10.1016\/j.cor.2006.09.003","DOI":"10.1016\/j.cor.2006.09.003"},{"key":"49_CR16_49","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"U Palekar","year":"1990","unstructured":"Palekar U, Karwan M, Zionts S (1990) A\u00a0Branch-and-Bound Method for Fixed Charge Transportation Problem.\nManag Sci 36:1092\u20131105","journal-title":"Manag Sci"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:01:23Z","timestamp":1720695683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_49","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}