Applications of MSG Framework to Routing
A.3. CONCLUSIONS AND DISCUSSION 167
Table A.2: CMSTP computational results. Parenthesised entries are the average percentage deviations from the best known solutions.
5 minutes 25 minutes
Params.200.9.3 Multistart-cmst Params.200.9.3 Multistart-cmst tc40Q3 0.105 (0.151) 1.384 (0.614) 0.028 (0.056) 1.384 (0.614) tc40Q5 0.643 (0.464) 1.527 (0.271) 0.643 (0.464) 1.527 (0.271) tc40Q10 0.000 (0.000) 0.320 (0.640) 0.000 (0.000) 0.320 (0.640) tc80Q5 3.381 (0.808) 4.164 (0.855) 2.667 (0.852) 4.001 (0.610) tc80Q10 1.963 (0.999) 2.959 (0.919) 1.387 (0.884) 2.890 (0.836) tc80Q20 0.710 (0.620) 0.766 (0.969) 0.71 (0.620) 0.766 (0.969) te40Q3 -0.036 (0.072) 0.780 (0.516) -0.036 (0.072) 0.780 (0.516) te40Q5 0.318 (0.399) 2.354 (0.755) 0.217 (0.434) 2.354 (0.755) te40Q10 0.584 (0.657) 2.628 (1.709) 0.584 (0.657) 2.628 (1.709) te80Q5 0.771 (0.400) 1.303 (0.564) 0.544 (0.371) 1.248 (0.544) te80Q10 2.578 (0.501) 3.764 (0.825) 2.161 (0.229) 3.715 (0.864) te80Q20 1.093 (1.224) 3.711 (2.418) 0.790 (1.116) 3.549 (2.356) cm50Q200 0.567 (0.633) 1.819 (1.272) 0.546 (0.650) 1.819 (1.272) cm50Q400 1.271 (0.835) 2.862 (0.888) 1.138 (0.778) 2.862 (0.888) cm50Q800 1.883 (0.903) 2.997 (1.510) 1.605 (0.840) 2.997 (1.510) cm100Q200 14.888 (1.814) 20.043 (2.424) 11.918 (1.764) 19.438 (3.068) cm100Q400 6.017 (1.291) 8.908 (1.744) 5.297 (1.315) 7.649 (0.806) cm100Q800 1.101 (0.480) 1.977 (1.170) 0.986 (0.522) 1.759 (0.868) cm200Q200 27.005 (2.485) 25.441 (3.056) 22.36 (1.675) 24.863 (2.716) cm200Q400 20.475 (4.415) 21.281 (4.272) 15.173 (3.454) 19.062 (3.803) cm200Q800 8.837 (2.573) 8.453 (3.450) 4.756 (1.758) 7.274 (2.769) Avg. 4.484 (1.034) 5.688 (1.469) 3.499 (0.881) 5.375 (1.352)
based metaheuristics can be chosen, such as Ant colony optimization [65] or also stochastic local search techniques [110] can be tested. Furthermore, the approach could also be improved by adding a mechanism such as the one used in Benders decomposition techniques [109], in which the slave return the master a set of constraints to reduce the search space.
Bibliography
[1] Adcock, S. (2011). GAUL: Genetic algorithm utility library. http://gaul.
sourceforge.net/. Viewed: November 2011.
[2] Ahuja, R., Ergun, ¨O., Orlin, J., and Punnen, A. (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123:75–102.
[3] Albert, I., Thakar, J., Li, S., Zhang, R., and Albert, R. (2008). Boolean network simulations for life scientists. Source Code for Biology and Medicine, 3(1):16.
[4] Aldana, M., Balleza, E., Kauffman, S., and Resendiz, O. (2007). Robust-ness and evolvability in genetic regulatory networks. Journal of Theoretical Biology, 245:433–448.
[5] Aldana, M., Coppersmith, S., and Kadanoff, L. (2003). Boolean dynamics with random couplings. In Kaplan, E., Marsden, J., and Sreenivasan, K., editors, Perspectives and Problems in Nonlinear Science. A celebratory vol-ume in honor of Lawrence Sirovich, Springer Applied Mathematical Sciences Series, pages 23–90. Springer, Heidelberg, Germany.
[6] Ansaloni, L., Villani, M., and Serra, R. (2009). Dynamical critical systems for information processing: a preliminary study. In [229].
[7] Applegate, D. and Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2):149–156.
[8] Bafna, V. and Bansal, V. (2004). The number of recombination events in a sample history: Conflict graph and lower bounds. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:78–90.
[9] Balleza, E., Alvarez-Buylla, E., Chaos, A., Kauffman, S., Shmulevich, I., and Aldana, M. (2008a). Critical dynamics in genetic regulatory networks:
Examples from four kingdoms. PLoS ONE, 3(6):e2456.
[10] Balleza, E., Alvarez-Buylla, E., Chaos, A., Kauffman, S., Shmulevich, I., and Aldana, M. (2008b). Critical dynamics in genetic regulatory networks:
Examples from four kingdoms. PLoS ONE, 3(6):e2456.
[11] Bar–Yam, Y. (1997). Dynamics of Complex Systems. Studies in nonlinear-ity. Addison–Wesley, Reading, MA.
169
[12] Barbieri, A., Villani, M., Serra, R., Kauffman, S., and Colacci, A. (2009).
Extended notion of attractors in noisy random Boolean networks. In [229].
[13] Bastolla, U. and Parisi, G. (1996). Closing probabilities in the Kauffman model: An annealed computation. Physica D, 98:1–25.
[14] Battarra, M., Benedettini, S., and Roli, A. (2011). Leveraging saving-based algorithms by master-slave genetic algorithms. Engineering Applications of Artificial Intelligence, 24:555–566.
[15] Battarra, M., Golden, B., and Vigo, D. (2008). Tuning a parametric Clarke–
Wright heuristic via a genetic algorithm. Journal of the Operations Research Society, 59:1568–1572.
[16] Benedettini, S. (2011a). The Boolean Network Toolkit. Available at:
http://booleannetwork.sourceforge.net. Viewed: November 2011.
[17] Benedettini, S. (2011b). EasyGenetic. Viewed: 11-Nov-2011.
[18] Benedettini, S., Blum, C., and Roli, A. (2010). A randomized iterated greedy algorithm for the founder sequence reconstruction problem. In Blum, C. and Battiti, R., editors, Proceedings of the Fourth Learning and Intelli-gent OptimizatioN Conference – LION 4, volume 6073 of Lecture Notes in Computer Science, pages 37–51. Springer, Heidelberg, Germany.
[19] Benedettini, S., Di Gaspero, L., and Roli, A. (2008a). Towards a highly scalable hybrid metaheuristic for haplotype inference under parsimony. Hy-brid Intelligent Systems, International Conference on, pages 702–707.
[20] Benedettini, S., Di Gaspero, L., and Roli, A. (2009a). Genetic master-slave algorithm for haplotype inference by parsimony. Technical Report DEIS-LIA-09-003, University of Bologna (Italy). LIA Series no. 93.
[21] Benedettini, S., Roli, A., and Di Gaspero, L. (2009b). EasyGenetic: A template metaprogramming framework for genetic master-slave algorithms.
In St¨utzle, T., Birattari, M., and Hoos, H., editors, Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, volume 5752 of Lecture Notes in Computer Science, pages 135–
139. Springer Berlin / Heidelberg.
[22] Benedettini, S., Roli, A., and Di Gaspero, L. (2009c). Easygenetic: A template metaprogramming framework for genetic master-slave algorithms.
Technical Report DEIS-LIA-09-005, University of Bologna (Italy). LIA Series no. 95.
[23] Benedettini, S., Roli, A., and Gaspero, L. (2008b). Two-level ACO for hap-lotype inference under pure parsimony. In Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence, ANTS ’08, pages 179–190. Springer Berlin / Heidelberg.
[24] Benedettini, S., Roli, A., Serra, R., and Villani, M. (2011). Stochastic lo-cal search to automatilo-cally design Boolean networks with maximally distant attractors. In Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ek´art, A., Esparcia-Alc´azar, A., Merelo, J., Neri, F., Preuss, M., Richter, H., Togelius,
BIBLIOGRAPHY 171 J., and Yannakakis, G., editors, Applications of Evolutionary Computation, Lecture Notes in Computer Science, pages 22–31. Springer, Heidelberg, Ger-many.
[25] Bernasconi, A. and Codenotti, B. (1993). Sensitivity of Boolean functions, harmonic analysis, and circuit complexity. Technical report, International Computer Science Institute, Berkley, CA.
[26] Bertolazzi, P., Godi, A., Labb´e, M., and Tininini, L. (2008). Solving hap-lotyping inference parsimony problem using a new basic polynomial formula-tion. Comput. Math. Appl., 55(5):900–911.
[27] Birattari, M. (2009). Tuning Metaheuristics: A Machine Learning Perspec-tive, volume 197 of Studies in Computational Intelligence. Springer, Heidel-berg, Germany.
[28] Birattari, M., Balaprakash, P., St¨utzle, T., and Dorigo, M. (2008).
Estimation-based local search for stochastic combinatorial optimization us-ing delta evaluations: A case study on the probabilistic travelus-ing salesman problem. INFORMS Journal on Computing, 20(4).
[29] Blin, G., Rizzi, R., Sikora, F., and Vialette, S. (2011). Minimum mosaic inference of a set of recombinants. In Potanin, A. and Viglas, T., editors, Proceedings of 17th Computing: the Australasian Theory Symposium – CATS 2011, CRPIT.
[30] Blum, C., Blesa, M., Roli, A., and Sampels, M., editors (2008). Hybrid Metaheuristics: An Emerging Approach to Optimization, volume 114 of Stud-ies in Computational Intelligence. Springer, Heidelberg, Germany.
[31] Blum, C. and Roli, A. (2003). Metaheuristics in combinatorial opti-mization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268–308.
[32] Blum, C.and Blesa Aguilera, M. J. and Roli, A.and Sampels, M., editors (2008). Hybrid Metaheuristics – An Emerging Approach to Optimization, volume 114 of Studies in Computational Intelligence. Springer.
[33] bnsim (2011). BNSim. http://code.google.com/p/bnsim/. Viewed:
November 2011.
[34] Bongard, J. C. (2011). Spontaneous evolution of structural modularity in robot neural network controllers. In Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO ’11, pages 251–258, New York, NY, USA. ACM.
[35] boost (2011). Boost C++ libraries. http://www.boost.org/. Viewed:
November 2011.
[36] Brent, R. P. (1980). An improved monte carlo factorization algorithm. BIT Numerical Mathematics, 20:176–184.
[37] Brown, D. and Harrower, I. (2004). A new integer programming formulation for the pure parsimony problem in haplotype analysis. In Jonassen, I. and Kim, J., editors, Algorithms in Bioinformatics, volume 3240 of Lecture Notes in Computer Science, pages 254–265. Springer Berlin / Heidelberg.
[38] Brown, D. G. and Harrower, I. M. (2006). Integer programming approaches to haplotype inference by pure parsimony. IEEE/ACM Transactions on Com-putational Biology and Bioinformatics, 3(2):141–154.
[39] Browning, B. L. and Browning, S. R. (2009). A unified approach to geno-type imputation and haplogeno-type-phase inference for large data sets of trios and unrelated individuals. The American Journal of Human Genetics, 84(2):210–
223.
[40] Browning, S. R. and Browning, B. L. (2011). Haplotype phasing: existing methods and new developments. Nature Reviews Genetics, 12(10):703–714.
[41] Cahon, S., Melab, N., and Talbi, E.-G. (2004). ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics, 10(3):357–380.
[42] Carchrae, T. and Beck, J. (2005). Applying machine learning to low-knowledge control of optimization algorithms. Computational Intelligence, 21(4):372–387.
[43] Caseau, Y. and Laburthe, F. (1999). Effective forget-and-extend heuristics for scheduling problems. In Focacci, F., Lodi, A., Milano, M., and Vigo, D., editors, Electronic Proceedings of the Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems – CPAIOR 1999.
[44] Catanzaro, D., Godi, A., and Labb´e, M. (2010). A class representative model for pure parsimony haplotyping. INFORMS Journal on Computing, 22:195–209.
[45] Catanzaro, D. and Labb´e, M. (2009). The pure parsimony haplotyping problem: overview and computational advances. International Transactions in Operational Research, 16(5):561–584.
[46] Chambers, J. (1983). Graphical Methods for Data Analysis. Springer, Berlin, Germany.
[47] Chambers, J., Cleveland, W., Kleiner, B., and Tukey, P. (1983). Graphical Methods for Data Analysis. Wadsworth & Brooks/Cole.
[48] Chambers, J. M. and Cleveland, W.S. and Kleiner, B. and Tukey, P.A.
(1983). Graphical Methods for Data Analysis. Chapman and Hall, New York.
[49] Chau, K. W. (2004). A two-stage dynamic model on allocation of construc-tion facilities with genetic algorithm. Automaconstruc-tion in Construcconstruc-tion, 13:481–
490.
[50] Cheng, D. and Qi, H. (2009). Controllability and observability of boolean control networks. Automatica, 45(7):1659–1667.
BIBLIOGRAPHY 173 [51] Cheng, D., Qi, H., and Li, Z. (2011). Analysis and Control of Boolean Networks: A Semi-tensor Product Approach. Communications and Control Engineering. Springer.
[52] Chiarandini, M., Dumitrescu, I., and St¨utzle, T. (2008). Very large-scale neighborhood search: Overview and case studies on coloring problems. In [30], pages 117–150.
[53] Chiarandini, M. and St¨utzle, T. (2002). An application of iterated local search to graph coloring problem. In Johnson, D. S., Mehrotra, A., and Trick, M., editors, Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pages 112–125.
[54] Clark, A. G. (1990). Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biology and Evolution, 7:111–122.
[55] Clarke, G. and Wright, J. W. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12:568–581.
[56] Climer, S., J¨ager, G., Templeton, A. R., and Zhang, W. (2009). How frugal is mother nature with haplotypes? Bioinformatics, 25(1):68–74.
[57] Conover, W. (1999). Practical Nonparametric Statistics. John Wiley &
Sons, Hoboken, NJ, USA, 3rd edition.
[58] Daly, M. J., Rioux, J. D., Schaffner, S. F., Hudson, T. J., and Lander, E. S.
(2001). High-resolution haplotype structure in the human genome. Nature Genetics, 29:229–232.
[59] Derrida, B. and Pomeau, Y. (1986). Random networks of automata: a simple annealed approximation. Europhysics Letters, 1(2):45–49.
[60] Di Gaspero, L. and Roli, A. (2008). Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony. Journal of Algorithms: Algorithms in Logic, Informatics and Cognition, 63(1–3):55–69.
[61] Di Gaspero, L. and Roli, A. (2009). Flexible stochastic local search for hap-lotype inference. In Selman, B., Battiti, R., and St¨utzle, T., editors, Learning and Intelligent Optimization - Third International Conference, LION 2009, volume 5851 of Lecture Notes in Computer Science, pages 74–88. Springer Berlin / Heidelberg.
[62] Di Gaspero, L. and Schaerf, A. (2003). EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software:
Practice and Experience, 33(8):733–765.
[63] Doman, C. (2008). Boolean Network Modeler. http://www.rustyspigot.
com/software/BooleanNetwork/. Viewed: November 2011.
[64] Dorigo, M. (1994). Learning by probabilistic Boolean networks. In Proceed-ings of World Congress on Computational Intelligence – IEEE International Conference on Neural Networks, pages 887–891, Orlando, Florida.
[65] Dorigo, M. and St¨utzle, T. (2004). Ant Colony Optimization. MIT Press, Cambridge, MA, USA.
[66] Drossel, B. (2005). Number of attractors in random Boolean networks.
Physcal Review E, 72:016110.
[67] ducktype (2011). Duck typing Wikipedia page. Viewed: 11-Nov-2011.
[68] EClab (2011). Viewed: 11-Nov-2011.
[69] E´en, N. and S¨orensson, N. (2006). Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2:1–
26.
[70] El-Araby, E. E., Yorino, N., and Sasaki, H. (2003). A two level hybrid ga/slp for facts allocation problem considering voltage security. International Journal of Electrical Power & Energy Systems, 25:327–335.
[71] El-Mabrouk, N. and Labuda, D. (2004). Haplotypes histories as pathways of recombinations. Bioinformatics, 20(12):1836–1841.
[72] Erdem, E. and T¨ure, F. (2008). Efficient haplotype inference with answer set programming. In AAAI’08: Proceedings of the 23rd national conference on Artificial intelligence, pages 436–441. AAAI Press.
[73] Eronen, L., Geerts, F., and Toivonen, H. (2004). A markov chain approach to reconstruction of long haplotypes. In Pacific Symposium on Biocomputing.
World Scientific, pages 104–115.
[74] Eronen, L., Geerts, F., and Toivonen, H. (2006). Haplorec: efficient and accurate large-scale reconstruction of haplotypes. BMC Bioinformatics, 7(1):542.
[75] Esau, L. R. and Williams, K. C. (1966). On teleprocessing system design.
IBM Systems Journal, 5:142–147.
[76] Esmaeili, A. and Jacob, C. (2008). Evolution of discrete gene regulatory models. In Keijzer, M., editor, Proceedings of GECCO’08 – Genetic and Evolutionary Computation Conference, pages 307–314, Atlanta, GA.
[77] Espinosa-Soto, C. and Wagner, A. (2010). Specialization can drive the evolution of modularity. PLoS Comput Biol, 6(3):e1000719+.
[78] Fates, N. (2011). Stochastic cellular automata solve the density classifica-tion problem with an arbitrary precision. In Proceedings of the Symposium on Theoretical Aspects of Computer Science – STACS 2011, Leibniz Interna-tional Proceedings in Informatics (LIPIcs), pages 284–295.
[79] Fiedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Mathe-matical Journal, 23(2):298–305.
[80] Fretter, C. and Drossel, B. (2008). Response of Boolean networks to per-turbations. European Physical Journal B, 62:365–371.
[81] Fretter, C., Szejka, A., and Drossel, B. (2009). Perturbation propaga-tion in random and evolved Boolean networks. New Journal of Physics, 11(3):033005:1–13.
BIBLIOGRAPHY 175 [82] Freund, Y. and Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119–139.
[83] Frigge, M., Hoaglin, D., and Iglewicz, B. (1989a). Some implementations of the boxplot. The American Statistician, 43(1):50–54.
[84] Frigge, M., Hoaglin, D., and Iglewicz, B. (1989b). Some implementations of the boxplot. The American Statistician, 43(1):50–54.
[85] Gamma, E., Johnson, R., Helm, R., and Vlissides, J. (1994). Design Pat-terns: Elements of Reusable Object-Oriented Software. Addison-Wesley.
[86] Garey, M. R. and Johnson, D. S. (1990). Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA.
[87] Georgopoulou, C. A. and Giannakoglou, K. C. (2009). Two-level, two-objective evolutionary algorithms for solving unit commitment problems. Ap-plied Energy, 86:1229–1239.
[88] Gershenson, C. (2004). Introduction to random Boolean networks. In Be-dau, M., Husbands, P., Hutton, T., Kumar, S., and Suzuki, H., editors, Work-shop and Tutorial Proceedings, Ninth International Conference on the Sim-ulation and Synthesis of Living Systems (ALife IX), pages 160–173, Boston, MA.
[89] Gershenson, C. (2011). RBNLab. http://sourceforge.net/projects/
rbn/. Viewed: November 2011.
[90] Glass, L. and Hill, C. (1998). Ordered and disordered dynamics in random networks. Europhysics Letters, 41(6):599–604.
[91] Glover, F. W. and Laguna, M. (1997). Tabu Search. Kluwer Academic Publishers, Norwell, MA, USA.
[92] Goldberg, D. (1989). Genetic algorithms in search, optimization and ma-chine learning. Addison–Wesley, Reading, MA.
[93] Gra¸ca, A., Lynce, I., Marques-Silva, J. a., and Oliveira, A. L. (2010). Hap-lotype Inference by Pure Parsimony: A Survey. Journal of Computational Biology, 17(8):969–992.
[94] Gra¸ca, A., Marques-Silva, J., Lynce, I., and Oliveira, A. L. (2007). Ef-ficient haplotype inference with pseudo-boolean optimization. In Anai, H., Horimoto, K., and Kutsia, T., editors, Algebraic Biology, Second Interna-tional Conference, AB 2007, Castle of Hagenberg, Austria, July 2-4, 2007, Proceedings, volume 4545 of Lecture Notes in Computer Science, pages 125–
139. Springer Berlin / Heidelberg, Berlin-Heidelberg, Germany.
[95] Gra¸ca, A., Marques-Silva, J., Lynce, I., and Oliveira, A. L. (2011). Hap-lotype inference with pseudo-boolean optimization. Annals of Operations Research, 184:137–162.
[96] Gra¸ca, A., Marques-Silva, J. a., Lynce, I., and Oliveira, A. L. (2008). Effi-cient haplotype inference with combined cp and or techniques. In Perron, L.
and Trick, M., editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 5015 of Lec-ture Notes in Computer Science, pages 308–312. Springer Berlin / Heidelberg.
[97] Graudenzi, A. and Serra, R. (2008). A new model of genetic network: the gene protein boolean network. In Serra, R., Villani, M., and Poli, I., editors, Artificial life and evolutionary computation – Proceedings of WIVACE 2008, pages 283–291. World Scientific Publishing, Singapore.
[98] Gregor, D., J¨arvi, J., Siek, J., Stroustrup, B., Dos Reis, G., and Lumsdaine, A. (2006). Concepts: linguistic support for generic programming in c++.
SIGPLAN Not., 41:291–310.
[99] Guerri, A. and Milano, M. (2004). Learning techniques for automatic al-gorithm portfolio selection. In Proceedings of the 16th Eureopean Conference on Artificial Intelligence, (ECAI 2004), pages 475–479. IOS Press.
[100] Gusev, A., Pasaniuc, B., and Mandoiu, I. (2008). Highly scalable geno-type phasing by entropy minimization. IEEE/ACM Trans. on Computational Biology and Bioinformatics, 5(2):252–261.
[101] Gusfield, D. (2001). Inference of haplotypes from sample diploid popula-tions: complexity and algorithms. Journal of Computational Biology, 8:305–
323.
[102] Gusfield, D. (2003). Haplotype inference by pure parsimony. In Baeza-Yates, R. A., Ch´avez, E., and Crochemore, M., editors, Combinatorial Pattern Matching (CPM 2003), Proceedings of the 14th Annual Symposium, volume 2676 of Lecture Notes in Computer Science, pages 144–155, Berlin-Heidelberg, Germany. Springer Berlin / Heidelberg.
[103] Halld´orsson, B., Bafna, V., Edwards, N., Lippert, R., Yooseph, S., and Istrail, S. (2004). A survey of computational methods for determining haplo-types. In Lecture Notes in Computer Science (2983): Computational Methods for SNPs and Haplotype Inference, pages 26–47. Springer.
[104] Halld´orsson, B. V., Bafna, V., Edwards, N., Lippert, R., Yooseph, S., and Istrail, S. (2002). A survey of computational methods for determining haplotypes. In Istrail, S., Waterman, M. S., and Clark, A. G., editors, Com-putational Methods for SNPs and Haplotype Inference, volume 2983 of Lec-ture Notes in Computer Science, pages 26–47, Berlin-Heidelberg, Germany.
Springer Berlin / Heidelberg.
[105] Halperin, E. and Karp, R. M. (2005). The minimum-entropy set cover problem. Theoretical Computer Science, 348:240–250.
[106] Hansen, P. and Mladenovi´c, N. (2001). Variable neighborhood search:
Principles and applications. European Journal of Operational Research, 130:449–467.