Author:
Almiñana Marc,Pastor Jesús T.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Statistics and Probability,Management Science and Operations Research,Information Systems and Management,Modeling and Simulation
Reference10 articles.
1. Almiñana, M. and J.T. Pastor (1994). Two New Heuristics for the Location Set Covering Problem,Top,2, 315–328.
2. Almiñana, M., and J. T. Pastor (1997). An adaption of SH Heuristic to the Location Set Covering Problem.European Journal of Operational Research,100, 586–593.
3. Balas, E., and A. Ho (1980). Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study.Mathematical Programming,12, 37–60.
4. Christofides, N. and J. Paixao (1984)Algorithms for large Scale Set Covering Problems, Internal Report, Imperial College, London.
5. Karp, R.M. (1972). Reducibility among combinatorial problems. In Miller and J.W. Tatcher, Eds.,Complexity of Computer Computations, Plenum Press, New York, 85–104.