Books on the topic 'Shortest paths'

Crisler, Nancy. Shortest paths. Lexington, Mass: COMAP, 1993.

Li, Fajie, and Reinhard Klette. Euclidean Shortest Paths. London: Springer London, 2011. http://dx.doi.org/10.1007/978-1-4471-2256-2.

Icking, Christian. Shortest paths for line segments. New York: Courant Institute of Mathematical Sciences, New York University, 1992.

Akman, Varol. Unobstructed Shortest Paths in Polyhedral Environments. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17629-2.

Brandimarte, Paolo. From Shortest Paths to Reinforcement Learning. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61867-4.

Unobstructed shortest paths in polyhedral environments. Berlin: Springer-Verlag, 1987.

Sharir, Micha. On shortest paths amidst convex polyhedra. New York: Courant Institute of Mathematical Sciences, New York University, 1985.

Baltsan, Avikam. On shortest paths between two convex polyhedra. New York: Courant Institute of Mathematical Sciences, New York University, 1985.

Reinhard, Klette, ed. Euclidean shortest paths: Exact or approximate algorithms. London: Springer-Verlag, 2011.

Dynamic Algorithms for Shortest Paths and Matching. [New York, N.Y.?]: [publisher not identified], 2016.

Cuerington, Andrè M. The shortest path problem in the plane with obstacles: Bounds on path lengths and shortest paths within homotopy classes. Monterey, Calif: Naval Postgraduate School, 1991.

Wensheng, Liu. Shortest paths for sub-Riemannian metrics on rank-two distributions. Providence, R.I: American Mathematical Society, 1995.

Crane, Jerry Allen. Searching for shortest and safest paths along obstacle common tangents. Monterey, Calif: Naval Postgraduate School, 1991.

Ruppert, Eric. Parallel algorithms for the k shortest paths and related problems. Toronto: University of Toronto, Dept. of Computer Science, 1996.

Adamatzky, Andrew, ed. Shortest Path Solvers. From Software to Wetware. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77510-4.

Dunn, Christine E. Notes on shortest path algorithms for GIS. Lancaster: North West Regional Research Laboratory, 1989.

1956-, Ahuja Ravindra K., and Sloan School of Management, eds. Faster algorithms for the shortest path problem. Cambridge, Mass: Sloan School of Management, Massachusetts Institute of Technology, 1988.

Tipici, Z. R. Shortest path and minimum cost low algorithms. Manchester: UMIST, 1993.

Camil, Demetrescu, Goldberg Andrew V, and Johnson David S. 1945-, eds. The shortest path problem: Ninth DIMACS implementation challenge. Providence, R.I: American Mathematical Society, 2009.

Young, Neal E. Faster parametric shortest path and minimum balance algorithms. Cambridge, Mass: Sloan School of Management, Massachusetts Institute of Technology, 1990.

GSA schedules: The shortest path to federal contract dollars. [Bethesda, Md]: Wood River Technologies, 2008.

Kant's shorter writings: Critical paths outside the Critiques. Newcastle-upon-Tyne, UK: Cambridge Scholars Publishing, 2016.

Allan, David. 802.1aq shortest path bridging design and evolution: The architects' perspective. New York, NY: Wiley, 2012.

Anand, Sachin. Graph theory and algorithms:implementation of Dijkstra's shortest path algorithm in Java. Oxford: Oxford Brookes University, 2001.

Guibas, Leonidas J. Linear time algorithms for visibility and shortest path problems inside simple polygons. New York: Courant Institute of Mathematical Sciences, New York University, 1986.

Shing, Man-Tak. Persistence search -- a new search strategy for the dynamic shortest path problem. Monterey, Calif: Naval Postgraduate School, 1991.

Farhat, Idriss. Evaluation of shortest path algorithms for an application of the travelling salesman problem. Oxford: Oxford Brookes University, 2004.

Ahuja, Ravindra K. Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems. Cambridge, Mass: Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1988.

Cisco OSPF Command and Configuration Handbook (paperback). Indianapolis: Cisco Press, 2008.

Conceptual data modeling and database design: A fully algorithmic approach : The shortest advisable path. Oakville, ON: Apple Academic Press, 2015.

Johnson, George. A shortcut through time: The path to a quantum computer. New York, NY: Alfred A. Knopf, 2003.

A shortcut through time: The path to a quantum computer. New York: Alfred A. Knopf, 2003.

Logan, Joseph. 7 simple steps to landing your first job: The shortest path from here to hired. Boulder, Co: Maytown Press, 2010.

Moser, Tijmen Jan. The shortest path method for seismic ray tracing in complicated media =: De kortste-routemethode voor seismische raytracing in gecompliceerde media. [Utrecht: Faculteit Aardwetenschappen der Rijksuniversiteit te Utrecht], 1992.

Jenkins, Kevin Dean. The shortest path problem in the plane with obstacles: A graph modeling approach to producing finite search lists of homotopy classes. Monterey, Calif: Naval Postgraduate School, 1991.

Routing first-step. Indianapolis, IN: Cisco Press, 2005.

1975-, Panov Taras E., ed. Toric topology. Providence, Rhode Island: American Mathematical Society, 2015.

Schorr, Amir, and Micha Sharir. On Shortest Paths in Polyhedral Spaces. Creative Media Partners, LLC, 2018.

Akman, Varol. Unobstructed Shortest Paths in Polyhedral Environments. Springer, 2007.

Klette, Reinhard, and Li Fajie. Euclidean Shortest Paths: Exact or Approximate Algorithms. Springer, 2011.

Baltsan, Avikam, and M. Sharir. On Shortest Paths Between Two Convex Polyhedra. Creative Media Partners, LLC, 2018.

Klette, Reinhard, and Fajie Li. Euclidean Shortest Paths: Exact or Approximate Algorithms. Springer London, Limited, 2014.

Ziegelmann, Dr Mark. Constrained Shortest Paths and Related Problems: Constrained Network Optimization. VDM Verlag Dr. Müller, 2010.

Newman, Mark. Computer algorithms. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198805090.003.0008.

Brandimarte, Paolo. From Shortest Paths to Reinforcement Learning: A MATLAB-Based Tutorial on Dynamic Programming. Springer International Publishing AG, 2022.

Brandimarte, Paolo. From Shortest Paths to Reinforcement Learning: A MATLAB-Based Tutorial on Dynamic Programming. Springer International Publishing AG, 2021.

Shiffrar, Maggie, and Christina Joseph. Paths of Apparent Human Motion Follow Motor Constraints. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199794607.003.0077.

Ortega-Arranz, Hector, Diego R. Llanos, and Arturo Gonzalez-Escribano. Shortest Path Problem. Morgan & Claypool Publishers, 2014.

The shortest path. FAO, 2021. http://dx.doi.org/10.4060/cb7278en.

Mann, Peter. Differential Equations. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198822370.003.0035.