Digital Commons @ Michigan Tech
metadata only
A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems#451646
- Sequential Object Placement Optimization with Convex Decomposition#1156453
- A SIMULATED ANNEALING ALGORITHM FOR DETECTING MOVING TARGETS#674709
- Bellman's Forest Problem and Computability#1106051
- Efficient Mathematical Programming Formulation and Algorithmic Framework for Optimal Camera Placement#1063732
Record · ID 283319
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive