A previously published integer linear programming model for finding a minimum cost schedule for railway locomotives to work a given set of trains is considered. Lagrangean relaxation is suggested as a effective means of solving the model.
No takes yet. Share an insight, caveat, or question.
J. M. P. Booler (1995) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: