{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:41:05Z","timestamp":1648676465085},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,12]],"date-time":"2015-02-12T00:00:00Z","timestamp":1423699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10479-015-1807-7","type":"journal-article","created":{"date-parts":[[2015,2,11]],"date-time":"2015-02-11T10:03:13Z","timestamp":1423648993000},"page":"397-408","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs"],"prefix":"10.1007","volume":"229","author":[{"given":"Mehdi","family":"Ghiyasvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,12]]},"reference":[{"key":"1807_CR1","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/S0097539791199334","volume":"35","author":"RK Ahuja","year":"1994","unstructured":"Ahuja, R. K., Orlin, J. B., Stein, C., & Tarjan, R. E. (1994). Improved algorithms for bipartite networks flow. SIAM Journal on Computing, 35, 906\u2013933.","journal-title":"SIAM Journal on Computing"},{"key":"1807_CR2","unstructured":"Chen, Y. L. (1991). An improved algorithm for scheduling jobs on heterogenuous processors. In National computer symposium (pp. 172\u2013177), Chung-Li, Taiwan."},{"key":"1807_CR3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0377-2217(93)E0161-P","volume":"80","author":"YL Chen","year":"1995","unstructured":"Chen, Y. L. (1995). A parametric maximum flow algorithm for bipatite graphs with applications. European Journal Operational Research, 80, 226\u2013235.","journal-title":"European Journal Operational Research"},{"key":"1807_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W Cunningham","year":"1985","unstructured":"Cunningham, W. (1985). Optimal attack and reinforcement in a networks. Journal of the ACM, 32, 549\u2013561.","journal-title":"Journal of the ACM"},{"key":"1807_CR5","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/321978.321982","volume":"23","author":"MJ Eisner","year":"1976","unstructured":"Eisner, M. J., & Severance, D. G. (1976). Mathematical techniques for efficient record segmentation in large shared databases. Journal of the ACM, 23, 619\u2013635.","journal-title":"Journal of the ACM"},{"key":"1807_CR6","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.35.3.378","volume":"35","author":"B Faaland","year":"1987","unstructured":"Faaland, B., & Schmitt, T. (1987). Scheduling tasks with due dates in fabrication\/assembly process. Operations Research, 35, 378\u2013388.","journal-title":"Operations Research"},{"key":"1807_CR7","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M. D., & Tarjan, R. E. (1989). A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing, 18, 30\u201355.","journal-title":"SIAM Journal on Computing"},{"key":"1807_CR8","unstructured":"Goldberg, A.V. (1984). Finding a maximum density subgraph, Berkeley technical report no. UCB\/CSD\/84\/171."},{"key":"1807_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/0216020","volume":"16","author":"D Gusfield","year":"1987","unstructured":"Gusfield, D., Martel, C., & Fernandez-Baca, D. (1987). Fast algorithms for bipartite network flow. SIAM Journal on Computing, 16, 237\u2013251.","journal-title":"SIAM Journal on Computing"},{"key":"1807_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0166-218X(86)90031-4","volume":"14","author":"P Hansen","year":"1986","unstructured":"Hansen, P., & Simeone, B. (1986). Unimodular functions. Discrete Applied Mathematics, 14, 269\u2013281.","journal-title":"Discrete Applied Mathematics"},{"key":"1807_CR11","unstructured":"Hochbaum, D.S. (March 1990). On a polynomial class of nonlinear optimization problems, UC Berkeley manuscript."},{"key":"1807_CR12","unstructured":"Hochbaum, D.S. (1998). A framework for half integrality and 2-approximations with applications to feasible cut and minimum satisfiability, UC Berkely manuscript, April 1996. In Jansen and Rolim (Eds.) Extended abstract version in Pro APPROX98, Lecture NOTES in Computer Science 1444 (pp. 99\u2013110). Berlin Heidelberg: Springer-Verlag."},{"key":"1807_CR13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/net.1012","volume":"37","author":"DS Hochbaum","year":"2001","unstructured":"Hochbaum, D. S. (2001). A new-old algorithm for minimum-cut and maximum-flow in closure graphs. Networks, 37, 171\u2013193.","journal-title":"Networks"},{"key":"1807_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01585160","volume":"62","author":"DS Hochbaum","year":"1993","unstructured":"Hochbaum, D. S., Megiddo, N., Naor, J., & Tamir, A. (1993). Tight bounds and 2-approximation algorithms for integer programs with variables per inequality. Mathematical Programming, 62, 69\u201383.","journal-title":"Mathematical Programming"},{"key":"1807_CR15","first-page":"269","volume":"69","author":"DS Hochbaum","year":"1995","unstructured":"Hochbaum, D. S., & Naor, J. (1995). Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 69, 269\u2013309.","journal-title":"SIAM Journal on Computing"},{"key":"1807_CR16","first-page":"391","volume-title":"Princeton Symposium of Math Programming, 1967","author":"A Hoffman","year":"1970","unstructured":"Hoffman, A., & Rivlin, J. (1970). When a team is mathematically eliminated? In H. W. Kuhn (Ed.), Princeton Symposium of Math Programming, 1967 (pp. 391\u2013401). Princeton, NJ: Princeton University Press."},{"key":"1807_CR17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"W Horn","year":"1974","unstructured":"Horn, W. (1974). Some simple scheduling algorithms. Naval Research Logistics Quarterly, 21, 177\u2013185.","journal-title":"Naval Research Logistics Quarterly"},{"key":"1807_CR18","first-page":"434","volume":"15","author":"AV Karzanov","year":"1974","unstructured":"Karzanov, A. V. (1974). Determining the maximal flow in a network by the method of preflows. Soviet Mathematical Doklady, 15, 434\u2013437.","journal-title":"Soviet Mathematical Doklady"},{"key":"1807_CR19","volume-title":"Combinatorial optimization: Networks and matroids","author":"EL Lawer","year":"1976","unstructured":"Lawer, E. L. (1976). Combinatorial optimization: Networks and matroids. New York: Holt Rinehart and Winston."},{"key":"1807_CR20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(78)90016-9","volume":"7","author":"VM Malhotra","year":"1978","unstructured":"Malhotra, V. M., Kumar, M. P., & Maheshwari, S. N. (1978). An $$O(|V|^3)$$ O ( | V | 3 ) algorithm for finding maximum flows in networks. Information Processing Letters, 7, 277\u2013278.","journal-title":"Information Processing Letters"},{"key":"1807_CR21","unstructured":"Mamer, J.W., & Smith, S.A. (1983). Job completion based inventory systems: Optimal policies for repair kits and spare machines, working paper no. 318, Western Management Science Institue, University of California."},{"key":"1807_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R Mcnaughton","year":"1959","unstructured":"Mcnaughton, R. (1959). Scheduling with deadlines and loss functions. Managment Science, 6, 1\u201312.","journal-title":"Managment Science"},{"key":"1807_CR23","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1002\/1520-6750(198710)34:5<605::AID-NAV3220340502>3.0.CO;2-L","volume":"34","author":"D Orlin","year":"1987","unstructured":"Orlin, D. (1987). Optimal weapons allocation againt layered defenses. Naval Research Logistics, 34, 605\u2013617.","journal-title":"Naval Research Logistics"},{"key":"1807_CR24","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"JC Picard","year":"1982","unstructured":"Picard, J. C., & Queyranne, M. (1982). A network flow solution of some nonlinear 0\u20131 programming problems and applications to graph theory. Networks, 12, 141\u2013159.","journal-title":"Networks"},{"key":"1807_CR25","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1016\/j.ejor.2005.01.062","volume":"174","author":"A Sedeno-Noda","year":"2006","unstructured":"Sedeno-Noda, A., Alcaide, D., & Gonzalez-Martin, C. (2006). Networks flow approaches to pre-emptive open-shop scheduling problems with time-windows. Eurpean Journal of Operational Research, 174, 1501\u20131518.","journal-title":"Eurpean Journal of Operational Research"},{"key":"1807_CR26","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.ejor.2008.02.031","volume":"196","author":"A Sedeno-Noda","year":"2009","unstructured":"Sedeno-Noda, A., Alcaide Lopez de Pablo, D., & Gonzalez-Martin, C. (2009). Gonzalez-Martin, Networks flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows. Eurpean Journal of Operational Research, 196, 140\u2013154.","journal-title":"Eurpean Journal of Operational Research"},{"key":"1807_CR27","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/1008062","volume":"8","author":"B Schwartz","year":"1966","unstructured":"Schwartz, B. (1966). Possible winners in partially complete tournaments. SIAM Review, 8, 302\u2013308.","journal-title":"SIAM Review"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1807-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1807-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1807-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:56Z","timestamp":1559153396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1807-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["1807"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1807-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,12]]}}}