Heuristic Search for the Generalized Minimum Spanning Tree Problem

References

• Aarts E. H. L., Lenstra J. K.Local Search in Combinatorial Optimization (1997) (John Wiley and Sons, Chichester, UK) Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algortihms and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Dror M., Haouari M., Chaouachi J. Generalized spanning trees. Eur. J. Oper. Res. (2000) 120:583–592Crossref, Google Scholar
• Feremans C.Generalized Spanning Trees and Extensions (2001) . Ph.D. thesis, Institut de Statistique et de Recherche Opérationnelle, Université Libre de Bruxelles, Bruxelles, BelgiumGoogle Scholar
• Feremans C., Labbé M., Laporte G. A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks (2002) 39:29–34Crossref, Google Scholar
• Feremans C., Labbé M., Laporte G. The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks (2004) 43:71–86Crossref, Google Scholar
• Fischetti M., Salazar-Gonzalez J. J., Toth P. Symmetric generalized traveling salesman problem. Oper. Res. (1997) 45:378–394Link, Google Scholar
• Goldberg D. E.Genetic Algorithms in Search, Optimization Machine Learning (1989) (Addison Wesley Longman, Inc., Reading, MA) Google Scholar
• Holland J. H. Outline for a logical theory of adaptive systems. J. Association Comput. Machinery (1962) 3:297–314Crossref, Google Scholar
• Michalewicz Z.Genetic Algorithms + Data Structures = Evolution Programs (1996) (Springer, Heidelberg, Germany) Crossref, Google Scholar
• Myung Y. S., Lee C. H., Tcha D. W. On the generalized minimum spanning tree problem. Networks (1995) 26:231–241Crossref, Google Scholar
• Pop P. C., Kern W., Still G. J. The generalized minimum spanning tree problem. (2000) . Technical report, Department of Operations Research and Mathematical Programming, University of Twente, Twente, The NetherlandsGoogle Scholar
• Pop P. C., Kern W., Still G. J. An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. (2001) . Technical report, Department of Operations Research and Mathematical Programming, University of Twente, Twente, The NetherlandsGoogle Scholar
• Raghavan S. On modeling the generalized minimum spanning tree. (2002) . Technical report, The Robert H. Smith School of Business, University of Maryland, College Park, MDGoogle Scholar
• Reinelt G. TSPLIB—A traveling salesman problem library. INFORMS J. Comput. (1991) 3:376–384Link, Google Scholar
• Tovey C. A., Aarts E. H. L., Lenstra J. K. Local improvement on discrete structures. Local Search in Combinatorial Optimization (1997) (John Wiley and Sons, Chichester, UK) 57–90Google Scholar
• Wong R. T. A dual ascent approach for Steiner tree problems on a directed graph. Math. Programming (1984) 28:271–287Crossref, Google Scholar