{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:28Z","timestamp":1725487168640},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_11","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"75-87","source":"Crossref","is-referenced-by-count":10,"title":["SCIL \u2014 Symbolic Constraints in Integer Linear Programming"],"prefix":"10.1007","author":[{"given":"Ernst","family":"Althaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Bockmayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Elf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Kasper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"11_CR1","unstructured":"D. Applegate, R. Bixby, V. Chv\u00e1tal, and W. Cook. Tsp-solver \u201cconcorde\u201d. http:\/\/www.keck.caam.rice.edu\/concorde.html , 1999."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N. Ascheuer","year":"2000","unstructured":"N. Ascheuer, M. J\u00fcnger, and G. Reinelt. A branch amp; cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Computational Optimization and Applications, 17(1):61\u201384, 2000.","journal-title":"Computational Optimization and Applications"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"E. Althaus, O. Kohlbacher, H.-P. Lenhof, and P. M\u00fcller. A combinatorial approach to protein docking with flexible side-chains. In Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00).","DOI":"10.1145\/332306.332319"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1137\/S0097539700366115","volume":"31","author":"E. Althaus","year":"2001","unstructured":"E. Althaus and K. Mehlhorn. Traveling salesman-based curve reconstruction in polynomial time. SIAM Journal on Computing, 31(1):27\u201366, 2001.","journal-title":"SIAM Journal on Computing"},{"issue":"12","key":"11_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":"11_CR6","first-page":"241","volume":"68","author":"E. Balas","year":"1995","unstructured":"E. Balas, M. Fischetti, and W. R. Pulleyblank. The precedenceconstrained asymmetric traveling salesman polytope. Mathematical Programming, 68:241\u2013265, 1995.","journal-title":"Mathematical Programming"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance. Branch-and-price: column generation for solving huge integer programs. Operations Research, 46:316\u2013329, 1998.","journal-title":"Operations Research"},{"key":"11_CR8","doi-asserted-by":"crossref","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 Journal on Computing, 10:287\u2013300, 1998.","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR9","unstructured":"A. Caprara and M. Fischetti. Annotated bibliographies in combinatorial optimization, chapter Branch-and-cut algorithms, pages 45\u201364. Wiley, 1997."},{"key":"11_CR10","unstructured":"GAMS Development Corporation. Gams: General algebraic modeling system, 2002."},{"key":"11_CR11","unstructured":"CPLEX. http:\/\/www.cplex.com ."},{"key":"11_CR12","unstructured":"Dash Associates. XPRESS 12 Reference Manual: XPRESS-MP Optimizer Subroutine Library XOSL, 2000."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G. B. Dantzig","year":"1954","unstructured":"G. B. Dantzig, D.R. Fulkerson, and S.M. Johnson. Solution of a large scale traveling salesman problem. Operations Research, 2:393\u2013410, 1954.","journal-title":"Operations Research"},{"key":"11_CR14","unstructured":"M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, and T. Graf. The constraint logic programming language CHIP. In Fifth Generation Computer Systems, Tokyo, 1988. Springer, 1988."},{"key":"11_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45586-8_5","volume-title":"Computational Combinatorial Optimization","author":"M. Elf","year":"2001","unstructured":"M. Elf, C. Gutwenger, M. J\u00fcnger, and G. Rinaldi. Computational Combinatorial Optimization, volume 2241 of Lecture Notes in Computer Science, chapter Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS, pages 157\u2013222. Springer, 2001."},{"key":"11_CR16","unstructured":"R. Fourer, D.M. Gay, and B. W. Kernighan. AMPL: A modeling language for Mathematical Programming. Duxbury Press\/Wadsworth Publishing, 1992."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger, and G. Reinelt. A cutting plane algorithm for the linear ordering problem. Operations Research, 32:1195\u20131220, 1984.","journal-title":"Operations Research"},{"key":"11_CR18","unstructured":"Ilog. http:\/\/www.ilog.com ."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M. J\u00fcnger","year":"2000","unstructured":"M. J\u00fcnger and S. Thienel. The abacus system for branch and cut and price algorithms in integer programming and combinatorial optimization. Software Practice and Experience, 30:1325\u20131352, 2000.","journal-title":"Software Practice and Experience"},{"key":"11_CR20","unstructured":"T. Kasper. A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming. PhD thesis, Fachbereich Informatik, Universit\u00e4t des Saarlandes, 1998."},{"key":"11_CR21","unstructured":"LEDA (Library of Efficient Data Types and Algorithms). http:\/\/www.algorithmic-solutions.com ."},{"key":"11_CR22","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages."},{"key":"11_CR23","unstructured":"D. Naddef. The Traveling Salesman Problem and its Variations, chapter Polyhedral theory, branch and cut algorithms for the symmetric traveling salesman problem. Kluwer Academic Publishing, 2002."},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"G. L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. John Wiley amp; Sons, 1988.","DOI":"10.1002\/9781118627372"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"M. Padberg and G. Rinaldi. A branch and cut algorithm for the resolution of large scale symmetric traveling salesman problems. SIAM Review, 33(60\u201310), 1991.","journal-title":"SIAM Review"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1007\/BF02174135","volume":"84","author":"C. Simone","year":"1996","unstructured":"C. Simone, M. Diehl, M. J\u00fcnger, P. Mutzel, and G. Rinaldi. Exact ground states of two-dimensional +-Jising spin glasses. Journal of Statistical Physics, 84:1363\u20131371, 1996.","journal-title":"Journal of Statistical Physics"},{"issue":"4es","key":"11_CR27","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/242224.242321","volume":"28","author":"G. Smolka","year":"1996","unstructured":"G. Smolka. Constraints in OZ. ACM Computing Surveys, 28(4es):75, December 1996.","journal-title":"ACM Computing Surveys"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"P. H. Vance","year":"1994","unstructured":"P. H. Vance, C. Barnhart, E. L. Johnson, and G. Nemhauser. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications, 3:111\u2013130, 1994.","journal-title":"Computational Optimization and Applications"},{"issue":"4","key":"11_CR29","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/242223.242279","volume":"28","author":"P. Hentenryck van","year":"1996","unstructured":"P. van Hentenryck and V. Saraswat. Strategic directions in constraint programming. ACM Computing Surveys, 28(4):701\u2013726, 1996.","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T23:06:18Z","timestamp":1556579178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}