dc.contributor.author | Mannino, Carlo | |
dc.contributor.author | Nakkerud, Andreas | |
dc.contributor.author | Sartor, Giorgio | |
dc.contributor.author | Schittekat, Patrick | |
dc.date.accessioned | 2019-01-11T08:32:09Z | |
dc.date.available | 2019-01-11T08:32:09Z | |
dc.date.created | 2019-01-10T16:36:53Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | SESAR Innovation Days. 2018, 7 | nb_NO |
dc.identifier.issn | 0770-1268 | |
dc.identifier.uri | http://hdl.handle.net/11250/2580278 | |
dc.description.abstract | We 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.abstract | Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm | nb_NO |
dc.language.iso | eng | nb_NO |
dc.relation.uri | https://www.sesarju.eu/sites/default/files/documents/sid/2018/papers/SIDs_2018_paper_80.pdf | |
dc.title | Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm | nb_NO |
dc.type | Journal article | nb_NO |
dc.type | Peer reviewed | nb_NO |
dc.description.version | publishedVersion | nb_NO |
dc.source.pagenumber | 7 | nb_NO |
dc.source.journal | SESAR Innovation Days | nb_NO |
dc.identifier.cristin | 1654423 | |
dc.relation.project | Norges forskningsråd: 237718 | nb_NO |
cristin.unitcode | 7401,90,26,0 | |
cristin.unitname | Mathematics and Cybernetics | |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |