Metaheuristics for optimization problems in computer communications
Computer Communications
Efficient parallel cooperative implementations of GRASP heuristics
Parallel Computing
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
On the k edge-disjoint 2-hop-constrained paths polytope
Operations Research Letters
The k edge-disjoint 3-hop-constrained paths polytope
Discrete Optimization
Journal of Global Optimization
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
INFORMS Journal on Computing
A hybrid data mining GRASP with path-relinking
Computers and Operations Research
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Given a graph with nonnegative edge weights and a set D of node pairs, the 2-path network problem requires a minimum weight set of edges such that the induced subgraph contains a path with one or two edges connecting each pair in D. The problem is NP-hard. We present two integer programming models for the problem and study properties of associated polytopes, including cutting planes. Two approximation algorithms are suggested and analyzed. Some computational experience is reported. © 2004 Wiley Periodicals, Inc.