Corpus ID: 195346566

The shortest way to visit all metro lines in Paris

  title={The shortest way to visit all metro lines in Paris},
  author={F. Sikora},
  • F. Sikora
  • Published 2017
  • Computer Science, Mathematics
  • ArXiv
What if $\{$a tourist, a train addict, Dr. Sheldon Cooper, somebody who likes to waste time$\}$ wants to visit all metro lines or carriages in a given network in a minimum number of steps? We study this problem with an application to the Parisian metro network and propose optimal solutions thanks to mathematical programming tools. Quite surprisingly, it appears that you can visit all 16 Parisian metro lines in only 26 steps (we denote by a step the act of taking the metro from one station to an… Expand
A Zero-Suppressed Binary Decision Diagram Approach for Constrained Path Enumeration
Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure called the zero-suppressed binaryExpand


On general routing problems
It is shown that a proposed conversion of required nodes to required arcs is not allowed and that the problem remains polynomial complete if Q = θ, and the proposed transformations from M vehicle to single vehicle problems are shown to be incorrect. Expand
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
Two new formulations for the generalized directed rural postman problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm are introduced. Expand
On the generalized directed rural postman problem
It is described how many types of practically relevant single-vehicle routing problems can be modelled as GDRPPs and its importance as a unified model for postman problems is demonstrated. Expand
The S-Bahn Challenge in Berlin
Traveling an entire subway or S-Bahn network as fast as possible has become a kind of sport in many major cities, with increasing popularity. The Guinness Book of Records already has several entriesExpand
Arc Routing: Problems, Methods, and Applications
This book provides a thorough and up-to-date discussion of arc routing by world-renowned researchers. Organized by problem type, the book offers a rigorous treatment of complexity issues, models,Expand
Matching, Euler tours and the Chinese postman
The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show thatExpand
Segment Abstraction for Worst-Case Execution Time Analysis
An algorithm for WCET estimation on ASTs, and an interpolation-based counterexample-guided refinement scheme for ASTs are developed, and a framework based on abstract segment trees (ASTs) is proposed, to obtain parametric estimates of WCET. Expand
The Rise and Fall of the Amateur New York Subway Riding Committee
  • 1980
Fastest time to travel to all New York City Subway stations. 416673-fastest-time-to-travel-to-all-new-york-city-subway-stations, 2016
  • 2017
Faire toutes les lignes du métro en un seul jour ? LQC #1
  • Youtube. https: //,
  • 2015