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.
Worst-Case Analysis of Network Design Problem Heu ris- tics
1 Pith paper cite this work, alongside 95 external citations. Polarity classification is still indexing.
1
Pith paper citing it
95
external citations · OpenAlex
citation-role summary
other 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 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.