A new bicriteria transit network design problem is shown to be NP-complete and inapproximable in general, with polynomial-time approximation schemes in restricted fixed-flow cases.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem
A new bicriteria transit network design problem is shown to be NP-complete and inapproximable in general, with polynomial-time approximation schemes in restricted fixed-flow cases.