SZodixStudyAcademic Library

Shelves Open access

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

Finding All Attractive Train Connections by Multi-criteria Pareto Search · Study

WorkFinding All Attractive Train Connections by Multi-criteria Pareto Search

Matthias Müller‐Hannemann2007

Work2007

Finding All Attractive Train Connections by Multi-criteria Pareto Search

Matthias Müller‐Hannemann · Mathias Schnee

64 citations·0/0 files stored·Springer eBooks

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 — 64 citations exist upstream.

References

2002Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys 1981Multiple Criteria Decision Making: Theory and Application 2000Dijkstra's algorithm on-line 1998Equilibrium and Advanced Transportation Modelling 1995Time depending shortest-path problems with applications to railway networks

Cited by

2012Round-Based Public Transit Routing 2016Practical Multicriteria Urban Bicycle Routing 2010Contraction of Timetable Networks with Realistic Transfers 2012Parallel computation of best connections in public transportation networks 2021The whole day path planning problem incorporating mode chains modeling in the era of mobility as a service 2005Timetable information and shortest paths 2013Result Diversity for Multi-Modal Route Planning 2018Non-additive shortest path in the context of traffic assignment

Related works

Explore the map →

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

2010Contraction of Timetable Networks with Realistic Transfersother · 3 shared references 2011Algorithm for Finding Optimal Paths in a Public Transit Network with Real-Time Dataarticle · 3 shared references 2016The constrained shortest path problem with stochastic correlated link travel timesarticle · 2 shared references 2004Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approacharticle · 2 shared references 2004Experimental Comparison of Shortest Path Approaches for Timetable Information.article · 2 shared references 2005Timetable information and shortest pathsthesis · 2 shared references

Details

Year2007

Typeother

Published2007-09-14

VenueSpringer eBooks

Languageen

Citations64

Files0 public / 0

ShelfTransportation Planning and Optimization

Identifiers

doi10.1007/978-3-540-74247-0_13

openalex_workW2118840184

Links

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