Show simple item record

dc.contributor.authorMannino, Carlo
dc.contributor.authorNakkerud, Andreas
dc.contributor.authorSartor, Giorgio
dc.contributor.authorSchittekat, Patrick
dc.date.accessioned2019-01-11T08:32:09Z
dc.date.available2019-01-11T08:32:09Z
dc.date.created2019-01-10T16:36:53Z
dc.date.issued2018
dc.identifier.citationSESAR Innovation Days. 2018, 7nb_NO
dc.identifier.issn0770-1268
dc.identifier.urihttp://hdl.handle.net/11250/2580278
dc.description.abstractWe extend the new, efficient Path&Cycle formulation for the Hotspot Problem with two methods for dealing with windowed capacity constraints. We also discuss how to combine constraints to allow two-level capacity restricions for peak and average load respectively. Finally, we present computational results for the sliding window capacity constraint.nb_NO
dc.description.abstractHotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithmnb_NO
dc.language.isoengnb_NO
dc.relation.urihttps://www.sesarju.eu/sites/default/files/documents/sid/2018/papers/SIDs_2018_paper_80.pdf
dc.titleHotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithmnb_NO
dc.typeJournal articlenb_NO
dc.typePeer reviewednb_NO
dc.description.versionpublishedVersionnb_NO
dc.source.pagenumber7nb_NO
dc.source.journalSESAR Innovation Daysnb_NO
dc.identifier.cristin1654423
dc.relation.projectNorges forskningsråd: 237718nb_NO
cristin.unitcode7401,90,26,0
cristin.unitnameMathematics and Cybernetics
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record