{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:02:32Z","timestamp":1743022952881,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45578-7_14","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"196-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Network Flow Problems in Constraint Programming"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Bockmayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolai","family":"Pisaruk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abderrahmane","family":"Aggoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"issue":"7","key":"14_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7):57\u201373, 1993.","journal-title":"Mathl. Comput. Modelling"},{"key":"14_CR2","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms and applications. Prentice Hall, 1993."},{"issue":"10","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1287\/mnsc.45.10.1440","volume":"45","author":"R. K. Ahuja","year":"1999","unstructured":"R. K. Ahuja, J. B. Orlin, G. M. Sechi, and P. Zuddas. Algorithms for the simple equal flow problem. Management Science, 45(10):1440\u20131455, 1999.","journal-title":"Management Science"},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-45349-0_6","volume-title":"Principles and Practice of Constraint Programming, CP\u20192000, Singapore","author":"N. Beldiceanu","year":"2000","unstructured":"N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. In Principles and Practice of Constraint Programming, CP\u20192000, Singapore, pages 52\u201366. Springer, LNCS 1894, 2000."},{"issue":"12","key":"14_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97\u2013123, 1994.","journal-title":"Mathl. Comput. Modelling"},{"key":"14_CR6","unstructured":"N. Beldiceanu, H. Simonis, Ph. Kay, and P. Chan. The CHIP system, 1997. \nhttp:\/\/www.cosytec.fr\/whitepapers\/PDF\/english\/chip3_OnlinePDF.pdf\n\n."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"A. Bockmayr and T. Kasper. Branch-and-infer: A unifying framework for integer and finite domain constraint programming. INFORMS J. Computing, 10(3):287\u2013300, 1998.","journal-title":"INFORMS J. Computing"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"H. A. Eiselt and C.-L. Sandblom. Integer programming and network models. Springer, 2000.","DOI":"10.1007\/978-3-662-04197-0"},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-45349-0_15","volume-title":"Principles and Practice of Constraint Programming, CP\u20192000, Singapore","author":"F. Focacci","year":"2000","unstructured":"F. Focacci, A. Lodi, and M. Milano. Cutting planes in constraint programming: An hybrid approach. In Principles and Practice of Constraint Programming, CP\u20192000, Singapore, pages 187\u2013201. Springer, LNCS 1894, 2000."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1090\/psapm\/010\/0114759","volume":"10","author":"A. J. Hoffman","year":"1960","unstructured":"A. J. Hoffman. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proceedings of Symposia on Applied Mathematics, 10:113\u2013127, 1960.","journal-title":"Proceedings of Symposia on Applied Mathematics"},{"key":"14_CR11","unstructured":"H. J. Kim and J. N. Hooker. Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. GSIA, Carnegie Mellon University, January 2001."},{"key":"14_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-45349-0_23","volume-title":"Principles and Practice of Constraint Programming, CP\u20192000, Singapore","author":"K. Mehlhorn","year":"2000","unstructured":"K. Mehlhorn and S. Thiel. Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In Principles and Practice of Constraint Programming, CP\u20192000, Singapore, pages 306\u2013319. Springer, LNCS 1894, 2000."},{"key":"14_CR13","unstructured":"M. Milano, G. Ottosson, P. Refalo, and E. S. Thorsteinsson. Global constraints: When constraint programming meets operation research. INFORMS Journal on Computing, Special Issue on the Merging of Mathematical Programming and Constraint Programming, March 2001. Submitted."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"G. Ottosson, E. S. Thorsteinsson, and J. N. Hooker. Mixed global constraints and inference in hybrid CLP-IP solvers. Annals of Mathematics and Artificial Intelligence, Special Issue on Large Scale Combinatorial Optimisation and Constraints, March 2001. Accepted for publication.","DOI":"10.1016\/S1571-0653(05)80104-0"},{"key":"14_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-45349-0_27","volume-title":"Principles and Practice of Constraint Programming, CP\u20192000, Singapore","author":"P. Refalo","year":"2000","unstructured":"P. Refalo. Linear formulation of constraint programming models and hybrid solvers. In Principles and Practice of Constraint Programming, CP\u20192000, Singapore, pages 369\u2013383. Springer, LNCS 1894, 2000."},{"key":"14_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/3-540-45349-0_28","volume-title":"Principles and Practice of Constraint Programming, CP\u20192000, Singapore","author":"J.-C. R\u00e9gin","year":"2000","unstructured":"J.-C. R\u00e9gin and M. Rueher. A global constraint combining a sum constraint and difference constraint. In Principles and Practice of Constraint Programming, CP\u20192000, Singapore, pages 384\u2013395. Springer, LNCS 1894, 2000."},{"key":"14_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/10722311_13","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"H. Simonis","year":"2000","unstructured":"H. Simonis, A. Aggoun, N. Beldiceanu, and E. Bourreau. Complex constraint abstraction: Global constraint visualisation. In Analysis and Visualization Tools for Constraint Programming, pages 299\u2013317. Springer, LNCS 1870, 2000."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:07:42Z","timestamp":1585602462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}