Author:
Alfieri Arianna,Kroon Leo,van de Velde Steef
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Industrial and Manufacturing Engineering,Software
Reference18 articles.
1. Balas E., Carrera M.C. (1990). A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research, 44: 25–42
2. Balas E., Ho A. (1980). Set covering algorithms using cutting planes, heuristics and subgradient optimization: A computational study. Mathematical Programming Study, 12: 37–60
3. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., Vance P.H. (1998). Branch–and–Price: Column generation for solving huge integer programs. Operations Research, 46: 316–329
4. Beasley J.E. (1990). A Lagrangian heuristic for set covering problems. Naval Research Logistics, 31:151–164
5. Caprara, A., Fischetti, M., Guida, P. L., Toth, P., & Vigo, D. (1997). Solution of large scale railway crew planning problems: The Italian experience. Proceedings of the 7th International Workshop on Computer Aided Scheduling of Public Transport, MIT.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献