6533b7d4fe1ef96bd12626b6
RESEARCH PRODUCT
GRASP with path relinking heuristics for the antibandwidth problem
Rafael MartíMauricio G. C. ResendeAbraham DuarteRicardo M. A. Silvasubject
Mathematical optimizationComputer Networks and CommunicationsGRASPSolverSet (abstract data type)Hardware and ArchitecturePath (graph theory)Node (circuits)HeuristicsInteger programmingMetaheuristicSoftwareInformation SystemsMathematicsdescription
This article 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. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(3), 171–189 2011 © 2011 Wiley Periodicals, Inc.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2010-12-22 | Networks |