Show simple item record

dc.contributor.authorThiriez, Herven_US
dc.contributor.otherMassachusetts Institute of Technology. Flight Transportation Laboratoryen_US
dc.date.accessioned2012-01-06T22:06:08Z
dc.date.available2012-01-06T22:06:08Z
dc.date.issued1969en_US
dc.identifier13452171en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/68065
dc.descriptionAlso issued as a Ph. D. thesis in the Dept. of Civil Engineering, Massachusetts Institute of Technology, 1970en_US
dc.descriptionOctober 1969en_US
dc.descriptionIncludes a [4] p. FTL memo no. M69-3, dated December 1969 with title: Set covering problems solved by group theory computational experience, by Herve Thiriezen_US
dc.descriptionErrata inserted after title-pageen_US
dc.descriptionIncludes bibliographical references (p. 105-108)en_US
dc.description.abstractThe problem of airline crew scheduling is studied, the different problems composing it are formulated and solution techniques are offered. Special emphasis is given to the set covering problem appearing in the rotation selection phase. An approach is presented, based on the group theoretic method, which allows the fast solution of problems with large sizesen_US
dc.format.extent[6], 108 pen_US
dc.publisherCambridge, Mass. : Massachusetts Institute of Technology, Flight Transportation Laboratory, 1969en_US
dc.relation.ispartofseriesFTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R69-1en_US
dc.relation.ispartofseriesFTL memorandum ; M-69-3en_US
dc.subjectFlight crewsen_US
dc.subjectLinear programmingen_US
dc.subjectGroup theoryen_US
dc.subjectMathematical optimizationen_US
dc.titleAirline crew scheduling : a group theoretic approachen_US
dc.title.alternativeSet covering problems solved by group theory computational experienceen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record