{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T23:35:43Z","timestamp":1783812943007,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540723967","type":"print"},{"value":"9783540723974","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_3","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:56:32Z","timestamp":1182542192000},"page":"29-43","source":"Crossref","is-referenced-by-count":23,"title":["Modeling the Regular Constraint with Integer Programming"],"prefix":"10.1007","author":[{"given":"Marie-Claude","family":"C\u00f4t\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A.T. Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research\u00a0153, 3\u201327 (2004)","journal-title":"European Journal of Operational Research"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"A.T. Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Owens, B., Sier, D.: An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research\u00a0127, 21\u2013144 (2004)","journal-title":"Annals of Operations Research"},{"key":"3_CR4","first-page":"339","volume":"2","author":"G. Dantzig","year":"1954","unstructured":"Dantzig, G.: A comment on Edie\u2019s traffic delay at toll booths. Operations Research\u00a02, 339\u2013341 (1954)","journal-title":"Operations Research"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1287\/opre.22.4.808","volume":"22","author":"M. Segal","year":"1974","unstructured":"Segal, M.: The operator-scheduling problem: A network-flow approach. Operations Research\u00a022, 808\u2013823 (1974)","journal-title":"Operations Research"},{"key":"3_CR6","first-page":"299","volume":"7","author":"B. Moondra","year":"1976","unstructured":"Moondra, B.: An LP model for work force scheduling for banks. Journal of Bank Research\u00a07, 299\u2013301 (1976)","journal-title":"Journal of Bank Research"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1287\/mnsc.36.11.1339","volume":"36","author":"S. Bechtolds","year":"1990","unstructured":"Bechtolds, S., Jacobs, L.: Implicit optimal modeling of flexible break assigments. Management Science\u00a036, 1339\u20131351 (1990)","journal-title":"Management Science"},{"key":"3_CR8","first-page":"223","volume":"43","author":"S. Bechtolds","year":"1996","unstructured":"Bechtolds, S., Jacobs, L.: The equivalence of general set-covering and implicit integer programming formulations for shift scheduling. Naval Research Logistics\u00a043, 223\u2013249 (1996)","journal-title":"Naval Research Logistics"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/mnsc.41.4.595","volume":"41","author":"G. Thompson","year":"1995","unstructured":"Thompson, G.: Improved implicit modeling of the labor shift scheduling problem. Management Science\u00a041, 595\u2013607 (1995)","journal-title":"Management Science"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/mnsc.42.4.591","volume":"42","author":"T. Aykin","year":"1996","unstructured":"Aykin, T.: Optimal shift scheduling with multiple break windows. Management Science\u00a042, 591\u2013602 (1996)","journal-title":"Management Science"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/mnsc.44.4.534","volume":"44","author":"M. Brusco","year":"1998","unstructured":"Brusco, M., Jacobs, L.: Personnel tour scheduling when starting-time restrictions are present. Management Science\u00a044, 534\u2013547 (1998)","journal-title":"Management Science"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0377-2217(80)90036-3","volume":"4","author":"G. Laporte","year":"1980","unstructured":"Laporte, G., Nobert, Y., Biron, J.: Rotating schedules. European Journal of Operational Research\u00a04(1), 24\u201330 (1980)","journal-title":"European Journal of Operational Research"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230200103","volume":"20","author":"A. Balakrishan","year":"1990","unstructured":"Balakrishan, A., Wong, R.: Model for the rotating workforce scheduling problem. Networks\u00a020, 25\u201342 (1990)","journal-title":"Networks"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:ANOR.0000019100.08333.a7","volume":"128","author":"M. Isken","year":"2004","unstructured":"Isken, M.: An implicit tour scheduling model with applications in healthcare. Annals of Operations Research (Special Issue on Staff Scheduling and Rostering)\u00a0128, 91\u2013109 (2004)","journal-title":"Annals of Operations Research"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"\u00c7ezik, T., G\u00fcnl\u00fck, O., Luss, H.: An integer programming model for the weekly tour scheduling problem. Naval Research Logistic\u00a048(7) (1999)","DOI":"10.1002\/nav.1037"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/S0377-2217(97)00006-4","volume":"104","author":"H. Millar","year":"1998","unstructured":"Millar, H., Kiragu, M.: Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. European Journal of Operational Research\u00a0104(3), 582\u2013592 (1998)","journal-title":"European Journal of Operational Research"},{"key":"3_CR17","unstructured":"Ernst, A., Hourigan, P., Krishnamoorthy, M., Mills, G., Nott, h., Sier, D.: Rostering ambulance officers. In: Proceedings of the 15th National Conference of the Australian Society for Operations Research, Gold Coast, pp. 470\u2013481 (1999)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/B:ANOR.0000019092.76669.a1","volume":"127","author":"M.S. Sodhi","year":"2003","unstructured":"Sodhi, M.S.: A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground. Annals of Operations Research\u00a0127, 259\u2013281 (2003)","journal-title":"Annals of Operations Research"},{"key":"3_CR19","volume-title":"Introduction to automata theory, languages and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1979)"},{"issue":"4-5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10732-006-6550-4","volume":"12","author":"W.J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.M.: On global warming: Flow-based soft global constraints. Journal of Heuristics\u00a012(4-5), 347\u2013373 (2006)","journal-title":"Journal of Heuristics"},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S. Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., Rousseau, L.-M.: A cost-regular based hybrid column generation approach. Constraints\u00a011(4), 315\u2013333 (2006)","journal-title":"Constraints"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/11889205_64","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C.-G. Quimper","year":"2006","unstructured":"Quimper, C.-G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 751\u2013755. Springer, Heidelberg (2006)"},{"key":"3_CR23","volume-title":"Network Flows.","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/11493853_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S. Demassey","year":"2005","unstructured":"Demassey, S., Pesant, G., Rousseau, L.-M.: Constraint programming based column generation for employee timetabling. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 140\u2013154. Springer, Heidelberg (2005)"},{"key":"3_CR25","unstructured":"Achterberg, T.: SCIP - a framework to integrate constraint and mixed integer programming. Technical Report 04-19, Zuse Institute Berlin (2004), http:\/\/www.zib.de\/Publications\/abstracts\/ZR-04-19\/"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/11889205_38","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M. Sellmann","year":"2006","unstructured":"Sellmann, M.: The theory of grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 530\u2013544. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T09:10:11Z","timestamp":1556529011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}