Jump to content

Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

11 May 2026

  • curprev 13:0313:03, 11 May 2026 Dcadmin talk contribs 1,110 bytes +1,110 Created page with "by: '''M. Fawad Zazai and Armin Fugenschuh''' '''Abstract''' Afghanistan is geo-strategically in an important transit zone in South and Central Asia, but currently lacks of modern infrastructure. We present the construction of optimal transit routes in Afghanistan through mathematical optimization. Basically there are three different optimization goals a) the shortest route w.r.t. the distance, b) the cheapest route w.r.t. the construction cost, and c) the most conveni..."
Retrieved from "https://dc.ifors.org/index.php/Computing_Pareto-Optimal_Transit_Routes_Through_Mathematical_Algorithms"