Author:
Caprara Alberto,Fischetti Matteo,Toth Paolo,Vigo Daniele,Guida Pier Luigi
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference33 articles.
1. N. Balakrishnan and R.T. Wong, A network model for the rotating workforce scheduling problem,Networks 20 (1990) 25–42.
2. E. Balas and M.C. Carrera, A dynamic subgradient-based branch-and-bound procedure for set covering,Operations Research 44 (1996) 875–890.
3. E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics and subgradient optimization: A computational study,Mathematical Programming Study 12 (1980) 37–60.
4. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, in: J.R. Birge and K.G. Murty, eds.,Mathematical Programming: State of the Art 1994 (The University of Michigan, 1994) 186–207.
5. J.E. Beasley, An algorithm for set covering problems,European Journal of Operational Research 31 (1987) 85–93.
Cited by
119 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献