首页 | 本学科首页   官方微博 | 高级检索  
     


An efficient interchange procedure for the archaeological seriation problem
Affiliation:1. Ecole des Hautes Etudes Commerciales de Montréal, 5255 avenue Decelles, Montréal H3T 1V6, Canada;1. Department of Computer Science and Technology, Tsinghua University, Beijing, China;2. School of Computer Science, Beijing University of Posts and Telecommunications, China;3. Tencent Incorporation, Shenzhen, China;1. Department of Anthropology, University of Pittsburgh, 3302 Wesley W. Posvar Hall, Pittsburgh, PA 15260, USA;2. Department of Anthropology, Northern Arizona University, 5 E. McConnell Dr., Flagstaff, AZ 86001, USA;3. Department of Anthropology & Institute of Archaeology, Baylor University, One Bear Place No. 97173, Waco, TX 76798, USA;4. Cornerstone Environmental Consulting, 320 N. Leroux St., Suite A, Flagstaff, AZ 86001, USA
Abstract:This paper considers the archaeological seriation problem defined over incidence matrices. Two procedures adapted from interchange algorithms for the travelling salesman problem are described and tested on 31 problems extracted from the literature. The better of these two procedures consistently yields excellent solutions and appears to outperform previous algorithms.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号