{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T08:57:53Z","timestamp":1783501073126,"version":"3.55.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10479-018-3004-y","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T02:17:31Z","timestamp":1534817851000},"page":"207-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The transportation problem with conflicts"],"prefix":"10.1007","volume":"298","author":[{"given":"Annette M. C.","family":"Ficker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"3004_CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall."},{"issue":"2","key":"3004_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1998.0938","volume":"28","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., & Kortsarz, G. (1998). Minimum color sum of bipartite graphs. Journal of Algorithms, 28(2), 339\u2013365.","journal-title":"Journal of Algorithms"},{"issue":"6\u20138","key":"3004_CR3","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.ipl.2015.02.001","volume":"115","author":"M Bender","year":"2015","unstructured":"Bender, M., Thielen, C., & Westphal, S. (2015). Packing items into several bins facilitates approximating the separable assignment problem. Information Processing Letters, 115(6\u20138), 570\u2013575.","journal-title":"Information Processing Letters"},{"issue":"2","key":"3004_CR4","first-page":"185","volume":"36","author":"B Cao","year":"1992","unstructured":"Cao, B. (1992). Transportation problem with nonlinear side constraints a branch and bound approach. Zeitschrift f\u00fcr Operations Research, 36(2), 185\u2013197.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"issue":"6","key":"3004_CR5","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/0305-0548(94)00055-D","volume":"22","author":"B Cao","year":"1995","unstructured":"Cao, B., & Uebe, G. (1995). Solving transportation problems with nonlinear side constraints with tabu search. Computers & Operations Research, 22(6), 593\u2013603.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"3004_CR6","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2016.2527003","volume":"28","author":"C Chen","year":"2016","unstructured":"Chen, C., Zheng, L., Srinivasan, V., Thomo, A., Wu, K., & Sukow, A. (2016). Conflict-aware weighted bipartite B-matching and its application to E-commerce. IEEE Transactions on Knowledge and Data Engineering, 28(6), 1475\u20131488.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3004_CR7","doi-asserted-by":"crossref","unstructured":"Darmann, A., Pferschy, U., Schauer, J., & Woeginger, G.\u00a0J. (2011). Paths, trees and matchings under disjunctive constraints. Discrete Applied Mathematics. 8th Cologne\/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 159(16), 1726 \u2013 1735.","DOI":"10.1016\/j.dam.2010.12.016"},{"issue":"3","key":"3004_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/moor.1110.0499","volume":"36","author":"L Fleischer","year":"2011","unstructured":"Fleischer, L., Goemans, M. X., Mirrokni, V. S., & Sviridenko, M. (2011). Tight approximation algorithms for maximum separable assignment problems. Mathematics of Operations Research, 36(3), 416\u2013431.","journal-title":"Mathematics of Operations Research"},{"key":"3004_CR9","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman & Co."},{"issue":"2","key":"3004_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00186-012-0397-2","volume":"76","author":"D Goossens","year":"2012","unstructured":"Goossens, D., Polyakovskiy, S., Spieksma, F. C. R., & Woeginger, G. J. (2012). Between a rock and a hard place: The two-to-one assignment problem. Mathematical Methods of Operations Research, 76(2), 223\u2013237.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1","key":"3004_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10288-007-0067-z","volume":"7","author":"D\u00a0R Goossens","year":"2009","unstructured":"Goossens, D\u00a0. R., & Spieksma, F. C\u00a0. R. (2009). The transportation problem with exclusionary side constraints. 4OR, 7(1), 51\u201360.","journal-title":"4OR"},{"key":"3004_CR12","unstructured":"H\u00e5stad, J. (1996). Clique is hard to approximate within $$n^{1-\\epsilon }$$. Proceedings of 37th Conference on Foundations of Computer Science, pp. 627\u2013636."},{"key":"3004_CR13","doi-asserted-by":"crossref","unstructured":"Kalra, T., Mathew, R., Pal, S.\u00a0P., & Pandey, V. (2017). Maximum weighted independent sets with a budget. In D. Gaur & N. Narayanaswamy (Eds.), CALDAM 2017, LNCS 10156, pp. 254\u2013266, Cham, Springer.","DOI":"10.1007\/978-3-319-53007-9_23"},{"key":"3004_CR14","doi-asserted-by":"crossref","unstructured":"Khot, S. (2001). Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, pp. 600\u2013609.","DOI":"10.1109\/SFCS.2001.959936"},{"issue":"4","key":"3004_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.orl.2004.07.006","volume":"33","author":"D Marx","year":"2005","unstructured":"Marx, D. (2005). A short proof of the NP-completeness of minimum sum interval coloring. Operations Research Letters, 33(4), 382\u2013384.","journal-title":"Operations Research Letters"},{"issue":"1","key":"3004_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10878-011-9438-7","volume":"26","author":"U Pferschy","year":"2013","unstructured":"Pferschy, U., & Schauer, J. (2013). The maximum flow problem with disjunctive constraints. Journal of Combinatorial Optimization, 26(1), 109\u2013119.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"3004_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D Ratner","year":"1990","unstructured":"Ratner, D., & Warmuth, M. (1990). The $$(n^2-1)$$-puzzle and related relocation problems. Journal of Symbolic Computation, 10(2), 111\u2013137.","journal-title":"Journal of Symbolic Computation"},{"key":"3004_CR18","unstructured":"Salavatipour, M. (2000). On sum coloring of graphs. Master\u2019s Thesis, Department of Computer Science, University of Toronto."},{"issue":"4","key":"3004_CR19","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1009630528341","volume":"3","author":"M Sun","year":"1998","unstructured":"Sun, M. (1998). A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints. Journal of Heuristics, 3(4), 305\u2013326.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"3004_CR20","doi-asserted-by":"publisher","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. European Journal of Operational Research, 140(3), 629\u2013647.","journal-title":"European Journal of Operational Research"},{"issue":"3\u20134","key":"3004_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1024610128238","volume":"14","author":"A Syarif","year":"2003","unstructured":"Syarif, A., & Gen, M. (2003). Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm. Journal of Intelligent Manufacturing, 14(3\u20134), 389\u2013399.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"3004_CR22","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/S0097539796303123","volume":"29","author":"T Szkaliczki","year":"1999","unstructured":"Szkaliczki, T. (1999). Routing with minimum wire length in the dogleg-free manhattan model is NP-complete. SIAM Journal on Computing, 29(1), 274\u2013287.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"3004_CR23","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ejor.2014.02.055","volume":"237","author":"W Vancroonenburg","year":"2014","unstructured":"Vancroonenburg, W., Della Croce, F., Goossens, D., & Spieksma, F. C. R. (2014). The red\u2013blue transportation problem. European Journal of Operational Research, 237(3), 814\u2013823.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3004-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3004-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3004-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T20:40:43Z","timestamp":1613248843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3004-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,21]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3004"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3004-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,21]]},"assertion":[{"value":"21 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}