Finding All Attractive Train Connections by Multi-criteria Pareto Search-Reference-Cited by-同舟云学术

Finding All Attractive Train Connections by Multi-criteria Pareto Search

Published: Issue: Volume: Page:246-263
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Müller-Hannemann Matthias,Schnee Mathias

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74247-0_13.pdf

Reference20 articles.

1. Electronic Notes in Theoretical Computer Science;G.S. Brodal,2003

2. Ehrgott, M., Gandibleux, X.: An annotated biliography of multiobjective combinatorial optimization. OR Spektrum 22, 425–460 (2000)

3. Ehrgott, M., Gandibleux, X. (eds.): Multiple Criteria Optimization: State of the Art Annotated Bibliographic Survey. Kluwer Academic Publishers, Boston (2002)

4. Lecture Notes in Economics and Mathematical Systems;P. Hansen,1979

5. Mote, J., Murthy, I., Olson, D.L.: A parametric approach to solving bicriterion shortest path problems. European Journal of Operations Research 53, 81–92 (1991)

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Conformance of the Internet sales systems of Polish regional rail carriers with Regulation (EU) 2021/782 of the European Parliament and of the Council in the aspect of obligation of providing information about the minimal fares;Journal of Modern Science;2023-12-18

2. ULTRA: Unlimited Transfers for Efficient Multimodal Journey Planning;Transportation Science;2023-11

3. The whole day path planning problem incorporating mode chains modeling in the era of mobility as a service;Transportation Research Part C: Emerging Technologies;2021-11

4. An exact method for a class of robust shortest path problems with scenarios;Networks;2019-10-12

5. Multi-objective Optimization of Vehicle Routing with Environmental Penalty;Communications in Computer and Information Science;2019