Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 31 matches
- 2024
- Gorka Kobeaga, Jairo Rojas-Delgado, María Merino, José Antonio Lozano:
A revisited branch-and-cut algorithm for large-scale orienteering problems. Eur. J. Oper. Res. 313(1): 44-68 (2024) - 2023
- Trong-Hieu Tran, Cédric Pralet, Hélène Fargier:
Combining Incomplete Search and Clause Generation: An Application to the Orienteering Problems with Time Windows. CPAIOR 2023: 493-509 - Carlos Diaz Alvarenga, Stefano Carpin:
Track, Stop, and Eliminate: an Algorithm to Solve Stochastic Orienteering Problems Using MCTS. IROS 2023: 9894-9901 - 2022
- Rohan Ghuge, Viswanath Nagarajan:
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems. Math. Oper. Res. 47(2): 1612-1630 (2022) - Hoang Thanh Le, Martin Middendorf, Yuhui Shi:
An Improvement Heuristic Based on Variable Neighborhood Search for Dynamic Orienteering Problems with Changing Node Values and Changing Budgets. SN Comput. Sci. 3(4): 326 (2022) - Stefano Carpin, Thomas C. Thayer:
Solving Stochastic Orienteering Problems with Chance Constraints Using Monte Carlo Tree Search. CASE 2022: 1170-1177 - Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. IPCO 2022: 195-209 - (Withdrawn) Deep Reinforcement Learning for Orienteering Problems Based on Decomposition. CoRR abs/2204.11575 (2022)
- 2021
- Alexander Beckmann, Jürgen Zimmermann:
Multi-start Heuristics for Unit-Capacity Orienteering Problems. OR 2021: 247-253 - Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. CoRR abs/2111.07414 (2021) - 2020
- Thomas C. Thayer, Stefano Carpin:
Solving Large-scale Stochastic Orienteering Problems with Aggregation. IROS 2020: 2452-2458 - Rohan Ghuge, Viswanath Nagarajan:
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems. SODA 2020: 1039-1048 - Gorka Kobeaga, María Merino, José Antonio Lozano:
A revisited branch-and-cut algorithm for large-scale orienteering problems. CoRR abs/2011.02743 (2020) - 2018
- Aldy Gunawan, Hoong Chuin Lau, Kun Lu:
ADOPT: Combining parameter tuning and Adaptive Operator Ordering for solving a class of Orienteering Problems. Comput. Ind. Eng. 121: 82-96 (2018) - Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. Eur. J. Oper. Res. 265(2): 779-794 (2018) - Pradeep Varakantham, Akshat Kumar, Hoong Chuin Lau, William Yeoh:
Risk-Sensitive Stochastic Orienteering Problems for Trip Optimization in Urban Environments. ACM Trans. Intell. Syst. Technol. 9(3): 24:1-24:25 (2018) - 2017
- Cédric Verbeeck:
Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes. 4OR 15(1): 109-110 (2017) - Jan Faigl:
On self-organizing maps for orienteering problems. IJCNN 2017: 2611-2620 - 2016
- Nitish Korula:
Orienteering Problems. Encyclopedia of Algorithms 2016: 1481-1484 - 2015
- Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau:
DIRECT: A Scalable Approach for Route Guidance in Selfish Orienteering Problems. AAMAS 2015: 483-491 - 2014
- Brahim Aghezzaf, Hassan E. L. Fahim:
The multi-constraint team orienteering problem with time windows in the context of distribution problems: A variable neighborhood search algorithm. GOL 2014: 155-160 - 2013
- Pradeep Varakantham, Akshat Kumar:
Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems. ADT 2013: 387-398 - Chen-Chih Liao, Cheng-Hsin Hsu:
An approximation algorithm of orienteering problems for mobile computing. MobiSys 2013: 531-532 - 2012
- Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3): 23:1-23:27 (2012) - Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen, HuaXing Chen:
Dynamic Stochastic Orienteering Problems for Risk-Aware Applications. UAI 2012: 448-458 - Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen, HuaXing Chen:
Dynamic Stochastic Orienteering Problems for Risk-Aware Applications. CoRR abs/1210.4874 (2012) - 2010
- Nacima Labadi, Jan Melechovský, Roberto Wolfler Calvo:
An Effective Hybrid Evolutionary Local Search for Orienteering and Team Orienteering Problems with Time Windows. PPSN (2) 2010: 219-228 - 2009
- William Mennell:
Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem. University of Maryland, College Park, MD, USA, 2009 - Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza:
The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6): 831-842 (2009) - 2008
- Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. SODA 2008: 661-670
skipping 1 more match
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-04 07:22 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint