{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:03:53Z","timestamp":1725512633464},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681540"},{"type":"electronic","value":"9783540681557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68155-7_23","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T09:41:20Z","timestamp":1211190080000},"page":"283-287","source":"Crossref","is-referenced-by-count":0,"title":["Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts"],"prefix":"10.1007","author":[{"given":"Doug","family":"Altner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zlem","family":"Ergun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust Discrete Optimization and Network Flows. Mathematical Programming\u00a098(1), 49\u201371 (2003)","journal-title":"Mathematical Programming"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.22.2.257","volume":"22","author":"R. Carr","year":"1997","unstructured":"Carr, R.: Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. Mathematics of Operations Research\u00a022(2), 257\u2013265 (1997)","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B. Cherkassky","year":"1994","unstructured":"Cherkassky, B., Goldberg, A.: On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica\u00a019(4), 390\u2013410 (1994)","journal-title":"Algorithmica"},{"key":"23_CR4","unstructured":"Devanur, N., Papadimitriou, C., Saberi, A., Vazirani, V.: Market Equilibrium via a Primal-Dual Algorithm for a Convex Program. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (2002)"},{"key":"23_CR5","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.: Maximal Flow Through a Network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"23_CR6","unstructured":"Goldberg, A.: Andrew Goldberg\u2019s Network Optimization Library, \n                    \n                      http:\/\/avglab.com\/andrew\/soft.html"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Tarjan, R.: A New Approach to the Maximum Flow Problem. Journal of Associated Computing Machinery 35 (1988)","DOI":"10.1145\/48014.61051"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1287\/opre.48.6.894.12392","volume":"48","author":"D. Hochbaum","year":"2000","unstructured":"Hochbaum, D., Chen, A.: Improved Planning for the Open - Pit Mining Problem. Operations Research\u00a048, 894\u2013914 (2000)","journal-title":"Operations Research"},{"key":"23_CR9","unstructured":"R\u00e9gin, J.C.: A Filtering Algorithm for Constraints of Difference in Constraint Satisfaction Problems. In: The Proceedings of the Twelfth National Conference on Artificial Intelligence, vol.\u00a01, pp. 362\u2013367 (1994)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1287\/ijoc.1060.0191","volume":"19","author":"J. Royset","year":"2007","unstructured":"Royset, J., Wood, R.K.: Solving the Bi-objective Maximum-Flow Network-Interdiction Problem. INFORMS Journal on Computing\u00a019, 175\u2013184 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"23_CR11","unstructured":"Strickland, D., Barnes, E., Sokol, J.: Optimal Protein Structure Alignment Using Maximum Cliques. Operations Research (to appear, 2008)"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"3","author":"H.S. Stone","year":"1977","unstructured":"Stone, H.S.: Multiprocessor Scheduling with the Aid of Network Flow Algorithms. IEEE Transactions on Software Engineering\u00a03(1), 85\u201393 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/net.3230170108","volume":"17","author":"S. Wallace","year":"1987","unstructured":"Wallace, S.: Investing in Arcs in a Network to Maximize the Expected Max Flow. Networks\u00a017, 87\u2013103 (1987)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68155-7_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:38:28Z","timestamp":1620016708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68155-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681540","9783540681557"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68155-7_23","relation":{},"subject":[]}}