Note on characterizing the k-OPT neighborhood via group theory

Journal of Heuristics

Volumn 5, Issue 1, 1999, Pages 47-51

  Colletti, Bruce W ^a   Wesley Barnes, J ^a   Dokov, Steftcho ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; TOPOLOGY; TRAVELING SALESMAN PROBLEM;

DIHEDRAL GROUP; GROUP THEORY;

SET THEORY;

EID: 0345534680     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009639011305     Document Type: Article

References (6)

1. Fraleigh, J. (1976). A First Course in Abstract Algebra. Reading: Addison-Wesley.
2. Gilbert, W. (1976). Modern Algebra with Applications. New York: John Wiley & Sons.
3. Herstein, I. (1964). Topics in Algebra. Waltham: Xerox College Publishing.
4. Isaacs, I. (1994). Algebra: A Graduate Course. Pacific Grove: Brooks/Cole Publishing.
5. Lin, S., and B. Kernighan. (1973). "An Effective Heuristic Algorithm for the Traveling Salesman Problem," Operations Research 21, 498-516.
6. Schönert, Martin, et al. (1995). GAP - Groups, Algorithms, and Programming. Lehrstuhl D für Mathematik, Rheinisch Westfälische Technische. Hocheschule, Aachen, Germany, fifth edition.