<div class="csl-bib-body">
<div class="csl-entry">Frohner, N., & Raidl, G. (2022). Learning Value Functions for Same-Day Delivery Problems. In <i>Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022)</i> (pp. 20–21). http://hdl.handle.net/20.500.12708/142196</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/142196
-
dc.language.iso
en
-
dc.subject
Neighborhood Search
en
dc.title
Learning Value Functions for Same-Day Delivery Problems
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.relation.isbn
978-84-09-38381-8
-
dc.description.startpage
20
-
dc.description.endpage
21
-
dc.type.category
Abstract Book Contribution
-
tuw.booktitle
Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022)
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
dc.description.numberOfPages
2
-
tuw.author.orcid
0000-0002-3293-177X
-
tuw.event.name
Eighteenth International Conference on Computer Aided Systems Theory (Eurocast 2022)
en
tuw.event.startdate
20-02-2022
-
tuw.event.enddate
25-02-2022
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Las Palmas de Gran Canaria
-
tuw.event.country
ES
-
tuw.event.presenter
Frohner, Nikolaus
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairetype
Inproceedings
-
item.openairetype
Konferenzbeitrag
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.cerifentitytype
Publications
-
item.languageiso639-1
en
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.fulltext
no Fulltext
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity