Show simple item record

dc.contributor.authorAvella, Pasquale
dc.contributor.authorBoccia, Maurizio
dc.contributor.authorMannino, Carlo
dc.contributor.authorVasilyev, Igor
dc.date.accessioned2017-03-17T06:50:48Z
dc.date.available2017-03-17T06:50:48Z
dc.date.created2017-03-15T07:38:27Z
dc.date.issued2016
dc.identifier.citationCEUR Workshop Proceedings. 2016, 1623 787-790.nb_NO
dc.identifier.issn1613-0073
dc.identifier.urihttp://hdl.handle.net/11250/2434424
dc.description.abstractThe problem of sequencing and scheduling airplanes landing and taking off on a runway is under consideration. We propose a new family of valid inequalities which are obtained from the study of the single machine scheduling problem polytope.
dc.language.isoengnb_NO
dc.relation.urihttp://ceur-ws.org/Vol-1623/
dc.titleValid Inequalities for Time-indexed Formulations of the Runway Scheduling Problemnb_NO
dc.typeJournal articlenb_NO
dc.typePeer reviewednb_NO
dc.source.pagenumber787-790nb_NO
dc.source.volume1623nb_NO
dc.source.journalCEUR Workshop Proceedingsnb_NO
dc.identifier.cristin1458424
cristin.unitcode7401,90,11,0
cristin.unitnameAnvendt matematikk
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record