Relevant bibliographies by topics / Canadian Traveller problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Canadian Traveller problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Canadian Traveller problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Canadian Traveller problem"

1

Liao, Chung-Shou, and Yamming Huang. "The Covering Canadian Traveller Problem." Theoretical Computer Science 530 (April 2014): 80–88. http://dx.doi.org/10.1016/j.tcs.2014.02.026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Xu, Yinfeng, Maolin Hu, Bing Su, Binhai Zhu, and Zhijun Zhu. "The canadian traveller problem and its competitive analysis." Journal of Combinatorial Optimization 18, no. 2 (2008): 195–205. http://dx.doi.org/10.1007/s10878-008-9156-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Westphal, Stephan. "A note on the k-Canadian Traveller Problem." Information Processing Letters 106, no. 3 (2008): 87–89. http://dx.doi.org/10.1016/j.ipl.2007.10.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Demaine, Erik D., Yamming Huang, Chung-Shou Liao, and Kunihiko Sadakane. "Approximating the Canadian Traveller Problem with Online Randomization." Algorithmica 83, no. 5 (2021): 1524–43. http://dx.doi.org/10.1007/s00453-020-00792-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bender, Marco, and Stephan Westphal. "An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths." Journal of Combinatorial Optimization 30, no. 1 (2013): 87–96. http://dx.doi.org/10.1007/s10878-013-9634-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liao, Chung-Shou, and Yamming Huang. "Generalized Canadian traveller problems." Journal of Combinatorial Optimization 29, no. 4 (2013): 701–12. http://dx.doi.org/10.1007/s10878-013-9614-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bnaya, Zahy, Ariel Felner, Dror Fried, Olga Maksin, and Solomon Eyal Shimony. "Repeated-task Canadian Traveler Problem." AI Communications 28, no. 3 (2015): 453–77. http://dx.doi.org/10.3233/aic-150665.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yildirim, S., V. Aksakalli, and A. F. Alkaya. "Canadian Traveler Problem with Neutralizations." Expert Systems with Applications 132 (October 2019): 151–65. http://dx.doi.org/10.1016/j.eswa.2019.05.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fried, Dror, Solomon Eyal Shimony, Amit Benbassat, and Cenny Wenner. "Complexity of Canadian traveler problem variants." Theoretical Computer Science 487 (May 2013): 1–16. http://dx.doi.org/10.1016/j.tcs.2013.03.016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Alkaya, Ali Fuat, Serkan Yildirim, and Vural Aksakalli. "Heuristics for the Canadian traveler problem with neutralizations." Computers & Industrial Engineering 159 (September 2021): 107488. http://dx.doi.org/10.1016/j.cie.2021.107488.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Canadian Traveller problem"

1

Bergé, Pierre. "Algorithmes pour voyager sur un graphe contenant des blocages." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS480.

Full text
Abstract:
Nous étudions des problèmes NP-difficiles portant sur les graphes contenant des blocages.Nous traitons les problèmes de coupes du point de vue de la complexité paramétrée. La taille p de la coupe est le paramètre. Étant donné un ensemble de sources {s1,...,sk} et une cible t, nous proposons un algorithme qui construit une coupe de taille au plus p séparant au moins r sources de t. Nous nommons ce problème NP-complet Partial One-Target Cut. Notre algorithme est FPT. Nous prouvons également que la variante de Partial One-Target Cut, où la coupe est composée de noeuds, est W[1]-difficile. Notre s
APA, Harvard, Vancouver, ISO, and other styles
2

Filip, Sebastián. "Řešení problému kanadského cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2017. http://www.nusl.cz/ntk/nusl-320101.

Full text
Abstract:
This thesis deals with Canadian traveller problem (CTP), which can be defined as the shortest path problem in a stochastic environment. The overview of different CTP variants is presented in theoretical part of this thesis, as well as known solutions to these variants. In the next parts, the thesis focuses on the stochastic variation of CTP (SCTP). For this variant chosen solutions (strategies) are discussed more in depth. At the same time, the original strategies named UCTO and UCTP are presented. Further, the thesis deals with the description of a window application implemented in Java, whic
APA, Harvard, Vancouver, ISO, and other styles
3

Huang, Yam-Ming, and 黃彥銘. "Online Route Planning: Exploring the Canadian Traveller Problem from an Algorithmic Point of View." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/gqh895.

Full text
Abstract:
碩士<br>國立清華大學<br>工業工程與工程管理學系<br>101<br>We investigate online route planning problems, which find real applications in dynamic navigation systems used to avoid traffic congestion. This study focuses on several generalizations of the well-known CANADIAN TRAVELLER PROBLEM (CTP). Given a road network G=(V,E) in which there is a source s and a destination t in V, every edge e in E is associated with two possible distances: original d(e) and jam d^+ (e). A traveller only finds out which one of the two distances of an edge upon reaching an end vertex incident to the edge. The objective is to derive an
APA, Harvard, Vancouver, ISO, and other styles
4

Chan, Hsiang-Chen, and 詹庠宸. "A Study on Lower Bounds on the k-Canadian Traveler Problem." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/22124844997847554288.

Full text
Abstract:
碩士<br>國立臺北大學<br>資訊工程學系<br>103<br>This study investigated the special case of Canadian traveler problem(CTP). Canadian traveler problem can practice in a dynamic navigation system. Travelers using the shortest path from the starting point to the destination when traffic blocking because of environmental factors or external factors. In the k-Canadian traveler problem (k-CTP), a traveler is given a positively weighted graph G and two vertices s,t. At most k edges in G are blocked. The traveler only learn the blocking of an edge when he reaches one of its endpoints. The goal of the traveler is to
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Canadian Traveller problem"

1

Huang, Yamming, and Chung-Shou Liao. "The Canadian Traveller Problem Revisited." In Algorithms and Computation. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35261-4_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bergé, Pierre, Julien Hemery, Arpad Rimmel, and Joanna Tomasik. "On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem." In Combinatorial Optimization and Applications. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04651-4_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bergé, Pierre, and Lou Salaün. "Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts." In Approximation and Online Algorithms. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39479-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Huili, and Yinfeng Xu. "The k-Canadian Travelers Problem with Communication." In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21204-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shiri, Davood, and F. Sibel Salman. "New Variations of the Online k-Canadian Traveler Problem: Uncertain Costs at Known Locations." In Probability, Combinatorics and Control. IntechOpen, 2020. http://dx.doi.org/10.5772/intechopen.88741.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Canadian Traveller problem"

1

Guo, Hengwei, and Timothy D. Barfoot. "The Robust Canadian Traveler Problem Applied to Robot Routing." In 2019 International Conference on Robotics and Automation (ICRA). IEEE, 2019. http://dx.doi.org/10.1109/icra.2019.8794252.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Canadian Traveller problem"

1

Fienberg, Stephen E., and Andrew C. Thomas. Exploring the Consequences of IED Deployment with a Generalized Linear Model Implementation of the Canadian Traveller Problem. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada547012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography