{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T13:05:56Z","timestamp":1774098356006,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T00:00:00Z","timestamp":1200096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10288-007-0067-z","type":"journal-article","created":{"date-parts":[[2008,1,11]],"date-time":"2008-01-11T10:11:24Z","timestamp":1200046284000},"page":"51-60","source":"Crossref","is-referenced-by-count":19,"title":["The transportation problem with exclusionary side constraints"],"prefix":"10.1007","volume":"7","author":[{"given":"Dries","family":"Goossens","sequence":"first","affiliation":[]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,12]]},"reference":[{"key":"67_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A and Protasi M (1999). Complexity and approximation. Springer, Heidelberg"},{"key":"67_CR2","volume-title":"Business logistics management","author":"RH Ballou","year":"1998","unstructured":"Ballou RH (1998). Business logistics management. Prentice Hall, New York"},{"key":"67_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01417216","volume":"36","author":"B Cao","year":"1992","unstructured":"Cao B (1992). Transportation problem with nonlinear side constraints a branch and bound approach. Math Methods Oper Res (ZOR) 36: 185\u2013197","journal-title":"Math Methods Oper Res (ZOR)"},{"key":"67_CR4","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/0305-0548(94)00055-D","volume":"22","author":"B Cao","year":"1995","unstructured":"Cao B and Uebe G (1995). Solving transportation problems with nonlinear side constraints with tabu search. Comp Oper Res 22: 593\u2013603","journal-title":"Comp Oper Res"},{"key":"67_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.orl.2004.04.015","volume":"33","author":"SS Chauhan","year":"2005","unstructured":"Chauhan SS, Eremeev AV, Romanova AA, Servakh VV and Woeginger GJ (2005). Approximation of the supply scheduling problem. Oper Res Lett 33: 249\u2013254","journal-title":"Oper Res Lett"},{"key":"67_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR and Johnson DS (1979). Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York"},{"key":"67_CR7","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"MR Garey","year":"1988","unstructured":"Garey MR, Tarjan RE and Wilfong G (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Math Oper Res 13: 330\u2013349","journal-title":"Math Oper Res"},{"key":"67_CR8","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2006.03.010","volume":"178","author":"DR Goossens","year":"2007","unstructured":"Goossens DR, Maas AJT, Spieksma FCR and van de Klundert JJ (2007). Exact algorithms for procurement problems under a total quantity discount structure. Eur J Oper Res 178: 603\u2013626","journal-title":"Eur J Oper Res"},{"key":"67_CR9","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S and Toth P (1990). Knapsack problems: algorithms and computer implementations. Wiley, New York"},{"key":"67_CR10","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(01)00239-9","volume":"140","author":"M Sun","year":"2002","unstructured":"Sun M (2002). The transportation problem with exclusionary side constraints and two branch-and-bound algorithms. Eur J Oper Res 140: 629\u2013647","journal-title":"Eur J Oper Res"},{"key":"67_CR11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1023\/A:1024610128238","volume":"14","author":"A Syarif","year":"2003","unstructured":"Syarif A and Gen M (2003). Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm. J Intell Manuf 14: 389\u2013399","journal-title":"J Intell Manuf"},{"key":"67_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/321864.321874","volume":"22","author":"JW Wright","year":"1975","unstructured":"Wright JW (1975). The change-making problem. J Assoc Comput Mach 22: 125\u2013128","journal-title":"J Assoc Comput Mach"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0067-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0067-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0067-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0067-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,12]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0067-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,12]]}}}