{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:00Z","timestamp":1759847940810},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0377-2217(93)90056-s","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:16:17Z","timestamp":1056989777000},"page":"303-316","source":"Crossref","is-referenced-by-count":11,"title":["State space relaxation for set covering problems related to bus driver scheduling"],"prefix":"10.1016","volume":"71","author":[{"given":"Ana","family":"Paias","sequence":"first","affiliation":[]},{"given":"J.","family":"Paix\u00e3o","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0377-2217(93)90056-S_BIB1","first-page":"37","article-title":"Set covering algorithms using cutting planes, heuristics and subgradient optimization: A computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Mathematical Programming"},{"key":"10.1016\/0377-2217(93)90056-S_BIB2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","article-title":"An algorithm for set covering problems","volume":"31","author":"Beasley","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/0377-2217(93)90056-S_BIB3","series-title":"Algorithms for large scale set covering problems","author":"Christofides","year":"1984"},{"key":"10.1016\/0377-2217(93)90056-S_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","article-title":"State-space relaxation procedures for the computation of bounds to routing problems","volume":"11","author":"Christofides","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0377-2217(93)90056-S_BIB5","series-title":"Computer-Aided Transit Scheduling","year":"1988"},{"key":"10.1016\/0377-2217(93)90056-S_BIB6","series-title":"Computer-Aided Transit Scheduling","first-page":"83","article-title":"CREW-OPT: Crew scheduling by column generation","author":"Desrochers","year":"1988"},{"key":"10.1016\/0377-2217(93)90056-S_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","article-title":"A column generation approach to the urban transit crew scheduling problem","volume":"23","author":"Desrochers","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/0377-2217(93)90056-S_BIB8","series-title":"Computer-Aided Transit Scheduling","first-page":"149","article-title":"Development and implementation of an automatic system for the bus and crew scheduling at RN-PORTUGAL","author":"Eus\u00e9bio","year":"1988"},{"key":"10.1016\/0377-2217(93)90056-S_BIB9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/0377-2217(93)90056-S_BIB10","article-title":"Determina\u00e7\u00e3o de hor\u00e1rios de pessoal tripulante: Uma abordagem baseada numa relaxa\u00e7\u00e3o de espa\u00e7o deestados","author":"Paias","year":"1991"},{"key":"10.1016\/0377-2217(93)90056-S_BIB11","series-title":"Operational Research '90","article-title":"Transit crew scheduling on a personal workstation (MS\/DOS)","author":"Paix\u00e3o","year":"1990"},{"key":"10.1016\/0377-2217(93)90056-S_BIB12","series-title":"Generation of bus driver schedules","author":"Paix\u00e3o","year":"1985"},{"key":"10.1016\/0377-2217(93)90056-S_BIB13","series-title":"State space relaxation for the set covering problem","author":"Paix\u00e3o","year":"1986"},{"key":"10.1016\/0377-2217(93)90056-S_BIB14","series-title":"Computer Scheduling of Public Transport","first-page":"193","article-title":"Two approaches to computer crew scheduling","author":"Parker","year":"1981"},{"key":"10.1016\/0377-2217(93)90056-S_BIB15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","article-title":"A survey of Lagrangean techniques for discrete optimization","volume":"5","author":"Shapiro","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/0377-2217(93)90056-S_BIB16","series-title":"Computer Scheduling of Public Transport 2","year":"1985"},{"key":"10.1016\/0377-2217(93)90056-S_BIB17","series-title":"Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling","year":"1981"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:037722179390056S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:037722179390056S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:50:36Z","timestamp":1552927836000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/037722179390056S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["037722179390056S"],"URL":"https:\/\/doi.org\/10.1016\/0377-2217(93)90056-s","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}