Search - INRIA - Institut National de Recherche en Informatique et en Automatique

	1 2 Suivant Dernière	Relevance Author A→Z Author Z→A Title A→Z Title Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante 30 results per page 50 results per page 100 results per page Merci d'indiquer la raison de votre demande o Export XML-TEI BibTeX EndNote CSV PDF HTML Advanced export... Syndicated feeds RSS ATOM
	inria-00071582v1 Reports Alexandre Dolgui, N. Guschinsky, G. Levin, J.-M. Proth. Graph approach for balancing a class of transfer lines RR-4996, INRIA. 2003
	inria-00073098v1 Reports Fabrice Chauvet, Eugene Levner, Jean-Marie Proth. On PERT Networks with Alternatives [Research Report] RR-3583, INRIA. 1998, pp.21
	inria-00075429v1 Reports Zhen Liu. Optimal routing in the De Bruijn networks [Research Report] RR-1130, INRIA. 1990, pp.20
	hal-03559992v1 Conference papers Ali Al-Zoobi, David Coudert, Arthur Finkelstein, Jean-Charles Régin. On Finding k Earliest Arrival Time Journeys in Public Transit Networks ICORES 2022 - 11th International Conference on Operations Research and Enterprise Systems, Feb 2022, Virtual event, France. pp.314-325, ⟨10.5220/0010977200003117⟩
	inria-00496617v1 Reports Juan Antonio Cordero. MPR-based Pruning Techniques for Shortest Path Tree Computation [Research Report] RR-7329, INRIA. 2010
	hal-01242868v1 Journal articles Jamila Ben Slimane, Schott René, yeqiong Song, George Stacey Staples, Evangelia Tsiontsiou et al. Operator Calculus Algorithms for Multi-Constrained Paths International Journal of Mathematics and Computer Science, 2015, 10 (1)
	inria-00265297v2 Reports Omid Amini, Florian Huc, Janez Zerovnik. $(\ell,k)$-Routing on Plane Grids [Research Report] RR-6480, INRIA. 2008
	hal-00221493v1 Conference papers Eric Colin de Verdière, Alexander Schrijver. Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs STACS 2008, Feb 2008, Bordeaux, France. pp.181-192
	hal-00781400v1 Journal articles Gayun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski. Profile of Tries SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2009, 38 (5), pp.1821-1880. ⟨10.1137/070685531⟩
	hal-01344047v1 Journal articles Stéphane Chrétien, Franck Corset. A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in Directed Acyclic Graphs and reliability Statistics and Probability Letters, Elsevier, 2016, 117, pp.221-230. ⟨10.1016/j.spl.2016.06.001⟩
	hal-01555342v1 Journal articles Mohand yazid Saidi, Bernard Cousin. Resource Sharing Strategies: Which Sharing to Better Protect Primary Shortest Paths? Journal of High Speed Networks, IOS Press, 2017, pp.1-18. ⟨10.3233/JHS-170570⟩
	hal-01437580v1 Journal articles Silviu Maniu, Reynold Cheng, Pierre Senellart. An Indexing Framework for Queries on Probabilistic Graphs ACM Transactions on Database Systems, Association for Computing Machinery, 2017, ⟨10.1145/3044713⟩
	tel-01754661v1 Theses Kamel Aissat. Optimisation et intégration de la mobilité partagée dans les systèmes de transport multimodaux Autre [cs.OH]. Université de Lorraine, 2016. Français. ⟨NNT : 2016LORR0074⟩
	hal-01359084v2 Conference papers Adrian Kosowski, Laurent Viennot. Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons SODA 2017 - 28th ACM-SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelona, Spain
	tel-01868308v1 Theses Bastien Confais. Conception d'un système de partage de données adapté à un environnement de Fog Computing Calcul parallèle, distribué et partagé [cs.DC]. Université de Nantes, 2018. Français
	hal-00652051v1 Conference papers Christian Glacet, Nicolas Hanusse, David Ilcinkas. The Impact of Edge Deletions on the Number of Errors in Networks OPODIS 2011, Dec 2011, Toulouse, France. pp.378-391, ⟨10.1007/978-3-642-25873-2_26⟩
	hal-00946320v1 Conference papers Matthieu Gerard, François Clautiaux. planification hebdomadaire sur plusieurs sites d'un personnel hétérogène et poly-compétent sous contraintes multiples ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France
	hal-00387679v1 Journal articles Alexandre Dolgui, Nikolay Guschinsky, Genrikh Levin, Jean-Marie Proth. Optimisation of multi-position machines and transfer lines European Journal of Operational Research, Elsevier, 2008, 185 (3), pp.1375-1389. ⟨10.1016/j.ejor.2006.03.069⟩
	hal-02101800v1 Reports Cyril Gavoille, Eric Guevremont. Worst Case Bounds for Shortest Path Interval Routing [Research Report] LIP RR-1995-02, Laboratoire de l'informatique du parallélisme. 1995, 2+23p
	hal-03288988v1 Conference papers Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric. Sample complexity bounds for stochastic shortest path with a generative model Algorithmic Learning Theory, 2021, Paris, France
	hal-01781605v1 Journal articles Borzou Rostami, André Chassein, Michael Hopf, Davide Frey, Christoph Buchheim et al. The quadratic shortest path problem: complexity, approximability, and solution methods European Journal of Operational Research, Elsevier, 2018, 268 (2), pp.473 - 485. ⟨10.1016/j.ejor.2018.01.054⟩
	hal-00668381v1 Conference papers Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil. Loop-Free Super-Stabilizing Spanning Tree Construction 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), Sep 2010, New York, NY, United States. pp.50--64, ⟨10.1007/978-3-642-16023-3_7⟩
	hal-03264788v1 Reports David Coudert, Ali Al Zoobi, Arthur Finkelstein. On finding $k$ earliest arrival time journeys in public transit networks [Research Report] Inria. 2021
	inria-00073269v1 Reports François Baccelli, Konstantin Tchoumatchenko, Sergei Zuyev. Markov Paths on the Poisson-Delaunay Graph with applications to routing in mobile networks RR-3420, INRIA. 1998
	tel-02904074v1 Theses Dong Quan Vu. Models and Solutions of Strategic Resource Allocation Problems: Approximate Equilibrium and Online Learning in Blotto Games Computer Science and Game Theory [cs.GT]. Sorbonne Universites, UPMC University of Paris 6, 2020. English
	inria-00071730v1 Reports Rumen Andonov, Nicola yanev, Dominique Lavenier, Philippe Veber. Combinatorial approaches for segmentingbacterium genomes [Research Report] RR-4853, INRIA. 2003
	hal-00659437v1 Conference papers Sébastien Felix, Jérôme Galtier. Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to Transport Networks 11th International Conference on ITS Telecommunications, Aug 2011, Saint-Petersburg, Russia. pp.56
	inria-00477450v1 Reports Juan Antonio Cordero, Emmanuel Baccelli, Philippe Jacquet. OSPF over Multi-Hop Ad Hoc Wireless Communications [Research Report] RR-7268, INRIA. 2010, pp.26
	hal-01251438v1 Conference papers Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim. On the Quadratic Shortest Path Problem 14th International Symposium on Experimental Algorithms, Jun 2015, Paris, France. ⟨10.1007/978-3-319-20086-6_29⟩
	hal-01355135v1 Conference papers Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer. Shortest Path Embeddings of Graphs on Surfaces SoCG 2016 - 32nd International Symposium on Computational Geometry, Jun 2016, Boston, MA, United States. pp.43:1--43:16, ⟨10.4230/LIPIcs.SoCG.2016.43⟩
	1 2 Suivant Dernière	Relevance Author A→Z Author Z→A Title A→Z Title Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante 30 results per page 50 results per page 100 results per page o Export XML-TEI BibTeX EndNote CSV PDF HTML Advanced export... Syndicated feeds RSS ATOM

Document types Minimize

Author Minimize

Subject field Minimize

Laboratory Minimize

Language Minimize

Type of deposit Minimize

Year Minimize

Designed by Inria-IES Team : Hosted by HAL :