The line-planning problem seeks to determine the set of fixed routes (or lines) a transit operator should run, along with associated operation frequencies. We propose an optimization algorithm for the transit-line-planning problem based on bi-level programming that exploits the problem's...

We consider the robust single-source capacitated facility location problem with uncertainty in customer demands. A cardinality-constrained uncertainty set is assumed for the robust problem. To solve it efficiently, we propose an allocation-based formulation derived by Dantzig-Wolfe decomposition...