{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:46:10Z","timestamp":1747579570285},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:14:58Z","timestamp":1330280098000},"page":"481-498","source":"Crossref","is-referenced-by-count":20,"title":["Solving crew scheduling problems by constraint programming"],"prefix":"10.1007","author":[{"given":"Nabil","family":"Guerinik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Caneghem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"29_CR1","unstructured":"M.L. Balinski and R.E. Gomory, \u201cA mutual primal-dual simplex method\u201d, Recent Advances in Mathematical Programming, McGraw-Hill, pp 17\u201326, (1963)."},{"issue":"No.1","key":"29_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","volume":"6","author":"R.E. Bixby","year":"1994","unstructured":"R.E. Bixby, \u201cProgress in linear programming\u201d, ORSA journal on computing, vol. 6, No. 1, (1994), pp. 15\u201322.","journal-title":"ORSA journal on computing"},{"key":"29_CR3","unstructured":"V. Chv\u00e0tal, \u201cLinear Programming\u201d, W.H. Freeman and Company editors, New York, 1983."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"J.J. Forrest","year":"1992","unstructured":"J.J. Forrest, D. Goldfarb, \u201cSteepest-edge simplex algorithms for linear programming\u201d, Mathematical Programming, 57, p. 341\u2013374, 1992.","journal-title":"Mathematical Programming"},{"issue":"No.6","key":"29_CR5","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K.L. Hoffman","year":"1993","unstructured":"K.L. Hoffman and M. Padberg, \u201cSolving airline crew sheduling by Branch and Cut\u201d, Management Science vol. 39, No. 6, June 1993, 657\u2013682.","journal-title":"Management Science"},{"key":"29_CR6","volume-title":"Exercices et problemes resolus de recherche operationnelle (T3: programmation lin\u00e9aire et extensions; probl\u00e8mes classiques","author":"Roseaux","year":"1991","unstructured":"Roseaux, \u201cExercices et problemes resolus de recherche operationnelle (T3: programmation lin\u00e9aire et extensions; probl\u00e8mes classiques\u201d, Masson, Paris 1991."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:55Z","timestamp":1619573815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}