@techreport{TD:100088, att_abstract={{This paper proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with N nodes and must label the nodes in a way that each node receives a unique label from the set { 1, 2, ..., N }, such that, among all adjacent node pairs, the minimum difference between the node labels is maximized. Computational results show that only small instances of this problem can be solved exactly (to optimality) with a commercial integer programming solver and that the heuristics find high-quality solutions in much less time than the commercial solver. }}, att_authors={mr5626}, att_categories={C_CCF.1, C_CCF.2, C_CCF.6, C_CCF.7, C_CCF.8}, att_copyright={{Wiley-Blackwwell}}, att_copyright_notice={{The definitive version was published in Networks (Wiley-Blackwell). {{, 2010-12-22}}, and is available at http://onlinelibrary.wiley.com. }}, att_donotupload={}, att_private={false}, att_projects={}, att_tags={metaheuristics, bandwidth, antibandwidth, GRASP, path-relinking, evolutionary path-relinking}, att_techdoc={true}, att_techdoc_key={TD:100088}, att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100088_DS1_2010-06-24T16:04:21.604Z.pdf}, author={Mauricio Resende and Abraham Duarte and Ricardo M. A. Silva and Rafael MartÃ}, institution={{Networks}}, month={December}, title={{GRASP with path relinking heuristics for the antibandwidth problem}}, year=2010, }