Abstract The United States is faced with allocating funds from a limited budget to the repair or replacement of railroad track segments on military bases. The problem can be modeled as a very large binary knapsack problem having a single budget constraint and multiple precedence constraints. A procedure has been developed to convert this original problem into an equivalent knapsack problem with a single constraint and significantly fewer variables. The new knapsack problem, still too large to be solved optimally, is then solved efficiently by a heuristic which provides answers within a few percent of optimality. Furthermore, the quality of the solution improves with the size of the problem.
Allocating railroad maintenance funds by solving binary knapsack problems with precedence constraints
Transportation Research Part B: Methodological ; 22 , 3 ; 181-194
24.04.1987
14 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A mixed integer knapsack model for allocating funds to highway safety improvements
Online Contents | 2002
|A Method for Allocating Funds for Winter Maintenance
British Library Conference Proceedings | 1994
|British Library Online Contents | 2015
|RAILROAD MAINTENANCE SUPPORT SYSTEM, RAILROAD MAINTENANCE SUPPORT METHOD
Europäisches Patentamt | 2025
|