An iterative exact algorithm solves a mixed-integer line planning model faster than CPLEX by dynamically expanding paths and frequencies, and accounting for lost demand improves overall resource efficiency.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
An iterative exact algorithm solves a mixed-integer line planning model faster than CPLEX by dynamically expanding paths and frequencies, and accounting for lost demand improves overall resource efficiency.