scientific article

DOI10.3969/J.ISSN.1005-3026.2016.05.005zbMATH Open1363.90204MaRDI QIDQ3180863

No author found.

Publication date: 6 January 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

time constraintroad networklocation-based servicesoptimal path searchtrip planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Finding temporal paths under waiting time constraints 👍 👎
• Optimal path finding in direction, location, and time dependent environments 👍 👎
• On Pareto (dynamically) efficient paths 👍 👎
• Path optimization for the resource-constrained searcher 👍 👎
• Time complexity of a path formulated optimal routing algorithm 👍 👎
• Technical Note—The Complexity of the Optimal Searcher Path Problem 👍 👎
• Finding Temporal Paths Under Waiting Time Constraints. 👍 👎

This page was built for publication: