A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types | Sciact - Система учета научной деятельности ИМ СО РАН

A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types Научная публикация

Конференция

XXIII International Conference Mathematical Optimization Theory and Operations Research
30 июн. - 6 июл. 2024 , Омск

Сборник

Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings
Сборник, Springer Cham. Switzerland.2024. 464 c. ISBN 978-3-031-62792-7.

Журнал

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Вых. Данные

Год: 2024, Том: 14766, Страницы: 116-126 Страниц : 11 DOI: 10.1007/978-3-031-62792-7_8

Ключевые слова

Learning-augmented · Online algorithm · Prediction

Авторы

Kharchenko Yaroslav ¹ , Kononov Alexander ²

Организации

1	Novosibirsk State University
2	Sobolev Institute of Mathematics

We consider the parking permit problem with three permit types. First, we prove the tight lower bound on the competitiveness of any deterministic online algorithm. Next, we present a learning-augmented algorithm and show its’ consistency and robustness.

Kharchenko Y. , Kononov A.
A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types
В сборнике Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings. – Springer Cham., 2024. – C.116-126. – ISBN 978-3-031-62792-7. DOI: 10.1007/978-3-031-62792-7_8 Scopus OpenAlex

Поступила в редакцию:	12 апр. 2024 г.
Опубликована в печати:	18 июн. 2024 г.
Опубликована online:	18 июн. 2024 г.

Scopus:	2-s2.0-85198435324
OpenAlex:	W4399743143

Пока нет цитирований