Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Karen Aardal"'
Autor:
Jo Røislien, Pieter L. van den Berg, Thomas Lindner, Erik Zakariassen, Oddvar Uleberg, Karen Aardal, J. Theresia van Essen
Publikováno v:
Scandinavian Journal of Trauma, Resuscitation and Emergency Medicine, Vol 26, Iss 1, Pp 1-11 (2018)
Abstract Background Helicopter emergency medical services are important in many health care systems. Norway has a nationwide physician manned air ambulance service servicing a country with large geographical variations in population density and incid
Externí odkaz:
https://doaj.org/article/893c4de7f3c24865a58db964a43cbe68
Autor:
Pieter L van den Berg, Peter Fiskerstrand, Karen Aardal, Jørgen Einerkjær, Trond Thoresen, Jo Røislien
Publikováno v:
PLoS ONE, Vol 14, Iss 4, p e0215385 (2019)
BackgroundAmbulance services play a crucial role in providing pre-hospital emergency care. In order to ensure quick responses, the location of the bases, and the distribution of available ambulances among these bases, should be optimized. In mixed ur
Externí odkaz:
https://doaj.org/article/1a0d30d7dafb4bcb99a515dbb57e21e1
Publikováno v:
Operations Research Letters, 51(4)
Branch-and-bound for integer optimization typically uses single-variable disjunctions. Enumerative methods for integer optimization with theoretical guarantees use a non-binary search tree with general disjunctions based on lattice structure. These d
Publikováno v:
SIAM Journal on Optimization, Vol. 31, no.4, p. 2539-2557 (2021)
SIAM Journal on Optimization, 31(4), 2539-2557
SIAM Journal on Optimization, 31(4), 2539-2557
Here we consider the question whether the lattice reformulation of a linear integer program can be used to produce effective cutting planes. In particular, we aim at deriving split cuts that cut off more of the integrality gap than Gomory mixed-integ
Autor:
Karen Aardal, Laura Sanità
This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully review
Autor:
Peter Fiskerstrand, Jørgen Einerkjær, Pieter L. van den Berg, Karen Aardal, Trond Thoresen, Jo Røislien
Publikováno v:
PLoS ONE, 14(4):e0215385. Public Library of Science
PLoS ONE, 14(4)
PLOS ONE
e0215385
PLoS ONE, Vol 14, Iss 4, p e0215385 (2019)
PLoS ONE, 14(4)
PLOS ONE
e0215385
PLoS ONE, Vol 14, Iss 4, p e0215385 (2019)
BackgroundAmbulance services play a crucial role in providing pre-hospital emergency care. In order to ensure quick responses, the location of the bases, and the distribution of available ambulances among these bases, should be optimized. In mixed ur
Autor:
Karen Aardal, J. Theresia van Essen, Pieter L. van den Berg, Erik Zakariassen, Thomas Lindner, Jo Røislien
Publikováno v:
Injury Prevention: an international peer-reviewed journal for health professionals and others in injury prevention, 23(1)
Injury Prevention, 23(1), 10-15. BMJ Publishing Group
Injury Prevention
Injury Prevention, 23(1), 10-15. BMJ Publishing Group
Injury Prevention
Helicopter emergency medical services are an important part of many healthcare systems. Norway has a nationwide physician staffed air ambulance service with 12 bases servicing a country with large geographical variations in population density. The ai
Autor:
R.B.O. Kerkkamp, Karen Aardal
Publikováno v:
Operations Research Letters, 44(3), 329-335
We consider the Maximum Weighted Coverage problem (MCP). We can relate the MCP to optimisation problems using submodular functions. Performance guarantees of the Swap Local Search algorithm are known for these problems, but can be improved for the MC
Publikováno v:
Transportation Research. Part E: Logistics and Transportation Review, 110
Developments in vehicle automation and the shared economy call for new developments in routing flexible transport services. We propose a new type of insertion algorithm: an online dynamic insertion algorithm with demand forecasts. The performance of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d65af3aa32bfaef8e7afd17b3725225
http://resolver.tudelft.nl/uuid:7810f75f-5642-46a8-b595-bfee90d8162f
http://resolver.tudelft.nl/uuid:7810f75f-5642-46a8-b595-bfee90d8162f
Publikováno v:
SSRN Electronic Journal.
One of the key assumptions of timetabling algorithms is that a solution exists that meets the pre-specified constraints, like driving times, transfer constraints and headway constraints. If this assumption is satisfied, in most cases a timetable can