{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T05:08:45Z","timestamp":1725080925163},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,3,23]],"date-time":"2010-03-23T00:00:00Z","timestamp":1269302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-010-0730-1","type":"journal-article","created":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T05:09:29Z","timestamp":1269234569000},"page":"3-26","source":"Crossref","is-referenced-by-count":3,"title":["Rapidly computing robust minimum capacity s-t cuts: a\u00a0case study in solving a sequence of maximum flow\u00a0problems"],"prefix":"10.1007","volume":"184","author":[{"given":"Douglas S.","family":"Altner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zlem","family":"Ergun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,23]]},"reference":[{"key":"730_CR1","volume-title":"Network flows: theory, algorithms and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms and applications. New York: Prentice Hall."},{"key":"730_CR2","unstructured":"Altner, D. S. (2008). Advancements on problems involving maximum flows. Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia."},{"key":"730_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems","author":"D. S. Altner","year":"2008","unstructured":"Altner, D. S., & Ergun, \u00d6. (2008). Rapidly solving an online sequence of maximum flow problems with applications to computing robust minimum cuts. In L. Perron & M. A. Trick (Eds.), Lecture Notes in Computer Science: Vol.\u00a05015. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Berlin: Springer."},{"key":"730_CR4","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A. Atamt\u00fcrk","year":"2007","unstructured":"Atamt\u00fcrk, A., & Zhang, M. (2007). Two-stage robust network flow and design under demand uncertainty. Operations Research, 55, 662\u2013673.","journal-title":"Operations Research"},{"key":"730_CR5","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A. Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research, 23, 769\u2013805.","journal-title":"Mathematics of Operations Research"},{"key":"730_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas, D., & Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98, 49\u201371.","journal-title":"Mathematical Programming"},{"key":"730_CR7","unstructured":"Chaerani, D., & Roos, C. (2006). Modelling some robust design problems via conic optimization. Operations Research Proceedings, 209\u2013214."},{"key":"730_CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0020-0190(99)00019-8","volume":"69","author":"J. Cheriyan","year":"1999","unstructured":"Cheriyan, J., & Melhorn, K. (1999). An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Information Processing Letters, 69, 239\u2013242.","journal-title":"Information Processing Letters"},{"key":"730_CR9","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B. V. Cherkassky","year":"1994","unstructured":"Cherkassky, B. V., & Goldberg, A. V. (1994). On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19, 390\u2013410.","journal-title":"Algorithmica"},{"key":"730_CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. R. Ford","year":"1956","unstructured":"Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"730_CR11","unstructured":"Goldberg, A. V. (2010). Andrew V. Goldberg\u2019s network optimization library. http:\/\/avglab.com\/andrew\/soft.html ."},{"key":"730_CR12","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A. V. Goldberg","year":"1998","unstructured":"Goldberg, A. V., & Rao, S. (1998). Beyond the flow decomposition barrier. Journal of Associated Computing Machinery, 45, 783\u2013797.","journal-title":"Journal of Associated Computing Machinery"},{"key":"730_CR13","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum flow problem. Journal of Associated Computing Machinery, 35, 921\u2013940.","journal-title":"Journal of Associated Computing Machinery"},{"key":"730_CR14","unstructured":"Govindaraju, V. (2008). Professor of computer science and engineering, University of Buffalo, personal communication."},{"key":"730_CR15","unstructured":"Harris, T. E., & Ross, F. S. (1955). Fundamentals of a method for evaluating rail network capacities. Research Memorandum RM-1573, The RAND Corporation, Santa Monica, CA."},{"key":"730_CR16","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/opre.48.6.894.12392","volume":"48","author":"D. S. Hochbaum","year":"2000","unstructured":"Hochbaum, D. S., & Chen, A. (2000). Improved planning for the open-pit mining problem. Operations Research, 48, 894\u2013914.","journal-title":"Operations Research"},{"key":"730_CR17","unstructured":"Matsuoka, Y., & Fujishige, S. (2004). Practical efficiency of maximum flow algorithms using maximum adjacency (MA) orderings. Technical Report METR 2004-27, University of Tokyo."},{"key":"730_CR18","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"R. H. M\u00f6hring","year":"2003","unstructured":"M\u00f6hring, R. H., Schulz, A. S., Stork, F., & Uetz, M. (2003). Solving project scheduling problems by minimum cut computations. Management Science, 49, 330\u2013350.","journal-title":"Management Science"},{"key":"730_CR19","first-page":"3","volume":"14","author":"P. H. L. Monkhouse","year":"2005","unstructured":"Monkhouse, P. H. L., & Yeates, G. (2005). Beyond naive optimization. AUSIMM Spectrum Series, 14, 3\u20138.","journal-title":"AUSIMM Spectrum Series"},{"key":"730_CR20","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1002\/net.20183","volume":"50","author":"F. Ord\u00f3\u00f1ez","year":"2007","unstructured":"Ord\u00f3\u00f1ez, F., & Zhao, J. (2007). Robust capacity expansion of network flows. Networks, 50, 136\u2013145.","journal-title":"Networks"},{"key":"730_CR21","unstructured":"R\u00e9gin, J. C. (1994). A filtering algorithm for constraints of difference in constraint satisfaction problems. In Proceedings of the twelfth national conference on artificial intelligence, vol.\u00a01, pp.\u00a0362\u2013367."},{"key":"730_CR22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1060.0191","volume":"19","author":"J. O. Royset","year":"2007","unstructured":"Royset, J. O., & Wood, R. K. (2007). Solving the bi-objective maximum flow network interdiction problem. INFORMS Journal on Computing, 19, 175\u2013184.","journal-title":"INFORMS Journal on Computing"},{"key":"730_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"3","author":"H. S. Stone","year":"1977","unstructured":"Stone, H. S. (1977). Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering, 3, 85\u201393.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"730_CR24","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.1040.0189","volume":"53","author":"D. M. Strickland","year":"2005","unstructured":"Strickland, D. M., Barnes, E., & Sokol, J. S. (2005). Optimal protein structure alignment using maximum cliques. Operations Research, 53, 389\u2013402.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0730-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0730-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0730-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:01Z","timestamp":1559138881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0730-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,23]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["730"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0730-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,23]]}}}