Speeding up Martins’ algorithm for multiple objective shortest path problems

Title
Speeding up Martins’ algorithm for multiple objective shortest path problems
Authors
Keywords
Multiobjective shortest path problem, Labeling algorithm, Stop condition, Bidirectional routing, Pareto optimal set, 90C29, 05C85, 05C38, 68Q25, 90B06
Journal
4OR-A Quarterly Journal of Operations Research
Volume 11, Issue 4, Pages 323-348
Publisher
Springer Nature
Online
2013-02-22
DOI
10.1007/s10288-013-0232-5

Ask authors/readers for more resources

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started