Conceptio › Archive › Koc University Digital Collections
Koc University Digital Collectionsmetadata only

A model-based heuristic to the min max K-arc routing for connectivity problem

Koc University Digital Collections · Papers
Open Source ↗
industrial-engineering
industrial engineering; heuristic algorithms, arc routing problem; heuristic; mixed integer programming; network connectivity; road clearance
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 954456
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.