Koc University Digital Collections
metadata only
CC BY 3.0
A model-based heuristic to the min max K-arc routing for connectivity problem
We consider the post-disaster road clearing problem with the goal of restoring network connectivity in shortest time. Given a set of blocked edges in the road network, teams positioned at depot nodes are dispatched to open a subset of them that reconnects the network. After a team finishes working o
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
- Experimental multiple-path routing algorithm#220755
- Dynamics-preserving network reductions for ride-pooling paths#1070091
- Optimal Scheduling of Road Maintenance Jobs Considering Impact on Traffic Flows#609652
- Optimal Scheduling of Road Maintenance Jobs Considering Impact on Traffic Flows#458312
- Resource Allocation Optimizing Resource Allocation in Data Centers and Networks using AI to Efficiently Distribute Bandwidth and Computing Power#107770
Record · ID 954456
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