SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Contraction of Timetable Networks with Realistic Transfers · Study

WorkContraction of Timetable Networks with Realistic Transfers

Robert Geisberger2010

OA

Workgreen2010

Contraction of Timetable Networks with Realistic Transfers

Robert Geisberger

35 citations·0/0 files stored·Lecture notes in computer science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Complexity and Algorithms in Graphs Railway Systems and Energy Efficiency

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 35 citations exist upstream.

References

2007Efficient models for timetable information in public transportation systems 2000Dijkstra's algorithm on-line 1998Equilibrium and Advanced Transportation Modelling 2009Time-Dependent Route Planning 1995Time depending shortest-path problems with applications to railway networks 2007Finding All Attractive Train Connections by Multi-criteria Pareto Search 2010Time-Dependent Contraction Hierarchies and Approximation

Cited by

2012User-Constrained Multi-Modal Route Planning 2012Parallel computation of best connections in public transportation networks 2015Trip-Based Public Transit Routing 2015Public Transit Labeling 2013Connection Scan Accelerated 2015Scalable Transfer Patterns 2015Trip-Based Public Transit Routing 2013Is Timetabling Routing Always Reliable for Public Transport?

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2011Algorithm for Finding Optimal Paths in a Public Transit Network with Real-Time Dataarticle · 4 shared references 2007Finding All Attractive Train Connections by Multi-criteria Pareto Searchother · 3 shared references 2015Memetic Algorithm for Computing Shortest Paths in Multimodal Transportation Networksarticle · 3 shared references 2012User-Constrained Multi-Modal Route Planningother · 3 shared references 2012Parallel computation of best connections in public transportation networksarticle · 3 shared references 2005Timetable information and shortest pathsthesis · 3 shared references

Details

Year2010

Typeother

Published2010-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations35

Files0 public / 0

ShelfTransportation Planning and Optimization

Identifiers

doi10.1007/978-3-642-13193-6_7

openalex_workW1908662580

Links

Imported from OpenAlex (CC0) — nothing here is generated.