Blar i SINTEF Digital på tidsskrift "Computers & Operations Research"

Viser treff 1-2 av 2

    • A Lower Bound for the Node, Edge, and Arc Routing Problem 

      Bach, Lukas; Hasle, Geir; Wøhlk, Sanne (Journal article; Peer reviewed, 2013)
      The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004, although similar problems have been studied before. This problem, also called the Mixed Capacitated General Routing Problem ...

    • Air Traffic Flow Management with Layered Workload Constraints 

      Mannino, Carlo; Nakkerud, Andreas; Sartor, Giorgio (Peer reviewed; Journal article, 2020)
      Many regions of the world are currently struggling with congested airspace, and Europe is no exception. Motivated by our collaboration with relevant European authorities and companies in the Single European Sky ATM Research ...