Works (1)
Updated: July 5th, 2023 15:55
2007 journal article
Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 41(3), 320–341.
author keywords: train timetabling; Lagrangian relaxation; Branch and bound; heuristics; railway
TL;DR:
A generalized resource constrained project scheduling formulation is proposed to consider segment and station capacities as limited resources, and a branch-and-bound solution procedure is presented to obtain feasible schedules with guaranteed optimality.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
