FAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM (2008)
Abstract. Given a graph G = (V, E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We present a fast local search...
Fast local search for the maximum independent set problem (2008)
Diogo V. Andrade, Renato F. Werneck
Abstract. Given a graph G =(V,E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We present a fast local search...
GRASP with evolutionary path-relinking (2007)
Diogo V. Andrade, Diogo V. Andrade
ABSTRACT. We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied...
GRASP with path-relinking for network migration scheduling (2007)
Diogo V. Andrade, G. C. Resende
ABSTRACT. Network migration scheduling is the problem where inter-nodal traffic from an outdated telecommunications network is to be migrated to a new network. Nodes are migrated, one at each time...
Survivable composite-link IP network design with OSPF routing (2006)
Diogo V. Andrade, Luciana S. Buriol, Mikkel Thorup
ABSTRACT. OSPF, or Open Shortest Path First, is a commonly used interior gateway protocol. Given a network topology, a set of link types to be deployed, each having a different capacity, and...
A GRASP for PBX telephone migration scheduling (2006)
Diogo V. Andrade, G. C. Resende
ABSTRACT. A PBX, or private branch exchange, is a private telephone network used within an enterprise. The PBX telephone migration problem arises when an enterprise acquires a new PBX to replace an...
Survivable composite-link IP network design with OSPF routing (2006)
Diogo V. Andrade, Luciana S. Buriol
OSPF, or Open Shortest Path First, is a commonly used interior gateway protocol. An integer weight is assigned to each arc and the entire network topology and arc weights are known to each router....