Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Shortest Path Problem

Handbook of Research on Geoinformatics
The routing problem of finding the shortest—or least cost—path through a network.
Published in Chapter:
Routing
Kevin M. Curtin (George Mason University, USA)
Copyright: © 2009 |Pages: 8
DOI: 10.4018/978-1-59140-995-3.ch031
Abstract
Routing is the act of selecting a course of travel. Routing problems are one of the most prominent and persistent problems in geoinformatics. This large research area has a strong theoretical foundation with ties to operations research and management science. There are a wide variety of routing models to fit many different application areas, including shortest path problems, vehicle routing problems, and the traveling salesman problem, among many others. There are also a range of optimal and heuristic solution procedures for solving instances of those problems. Research is ongoing to expand the types of routing problems that can be solved, and the environments within which they can be applied.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR