{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T23:11:58Z","timestamp":1775862718467,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:00:00Z","timestamp":1322870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10878-011-9438-7","type":"journal-article","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T19:10:49Z","timestamp":1322939449000},"page":"109-119","source":"Crossref","is-referenced-by-count":63,"title":["The maximum flow problem with disjunctive constraints"],"prefix":"10.1007","volume":"26","author":[{"given":"Ulrich","family":"Pferschy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Schauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,3]]},"reference":[{"key":"9438_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New York"},{"key":"9438_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Protasi M, Marchetti-Spaccamela A, Gambosi G, Crescenzi P, Kann V (1999) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer, Berlin"},{"key":"9438_CR3","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-57182-5_21","volume-title":"MFCS \u201993: proceedings of the 18th international symposium on mathematical foundations of computer science","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender HL, Jansen K (1993) On the complexity of scheduling incompatible jobs with unit-times. In: MFCS \u201993: proceedings of the 18th international symposium on mathematical foundations of computer science. Springer, Berlin, pp 291\u2013300"},{"issue":"16","key":"9438_CR4","doi-asserted-by":"crossref","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann A, Pferschy U, Schauer J, Woeginger GJ (2011) Paths, trees and matchings under disjunctive constraints. Discrete Appl Math 159(16):1726\u20131735","journal-title":"Discrete Appl Math"},{"key":"9438_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"issue":"1","key":"9438_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10288-007-0067-z","volume":"7","author":"DR Goossens","year":"2009","unstructured":"Goossens DR, Spieksma FCR (2009) The transportation problem with exclusionary side constraints. 4OR 7(1):51\u201360","journal-title":"4OR"},{"key":"9438_CR7","first-page":"422","volume-title":"SODA \u201990: proceedings of the first annual ACM-SIAM symposium on discrete algorithms","author":"D Gusfield","year":"1990","unstructured":"Gusfield D, Naor D (1990) Efficient algorithms for generalized cut trees. In: SODA \u201990: proceedings of the first annual ACM-SIAM symposium on discrete algorithms. SIAM, Philadelphia, pp\u00a0422\u2013433"},{"key":"9438_CR8","first-page":"183","volume":"19","author":"HW Hamacher","year":"1984","unstructured":"Hamacher HW, Picard J-C, Queyranne M (1984) Ranking the cuts and cut-sets of a network. Ann Discrete Math 19:183\u2013200","journal-title":"Ann Discrete Math"},{"key":"9438_CR9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K Jansen","year":"1999","unstructured":"Jansen K (1999) An approximation scheme for bin packing with conflicts. J Comb Optim 3:363\u2013377","journal-title":"J Comb Optim"},{"issue":"2","key":"9438_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K Jansen","year":"1997","unstructured":"Jansen K, \u00d6hring S (1997) Approximation algorithms for time constrained scheduling. Inf Comput 132(2):85\u2013108","journal-title":"Inf Comput"},{"issue":"3","key":"9438_CR11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes. J Comput Syst Sci 43(3):425\u2013440","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"9438_CR12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy U, Schauer J (2009) The knapsack problem with conflict graphs. J Graph Algorithms Appl 13(2):233\u2013249","journal-title":"J Graph Algorithms Appl"},{"key":"9438_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-642-21527-8_34","volume-title":"INOC","author":"U Pferschy","year":"2011","unstructured":"Pferschy U, Schauer J (2011) The maximum flow problem with conflict and forcing conditions. In: INOC. Lecture notes in computer science, vol 6701. Springer, Berlin, pp 289\u2013294"},{"key":"9438_CR14","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J-C Picard","year":"1980","unstructured":"Picard J-C, Queyranne M (1980) On the structure of all minimum cuts in a network and applications. Math Program Stud 13:8\u201316","journal-title":"Math Program Stud"},{"issue":"2","key":"9438_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.disopt.2010.08.001","volume":"8","author":"R Zhang","year":"2011","unstructured":"Zhang R, Kabadi SN, Punnen AP (2011) The minimum spanning tree problem with conflict constraints and its variations. Discrete Optim 8(2):191\u2013205","journal-title":"Discrete Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9438-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9438-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9438-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T07:40:11Z","timestamp":1561016411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9438-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9438"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9438-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,3]]}}}