Path-relinking is a major enhancement to the basic greedy randomized adaptive search
procedure (GRASP), leading to significant improvements in solution time and quality. Path …

Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

For the past few decades, combinatorial optimization techniques have been shown to be
powerful tools for formulating and solving optimization problems arising from practical …

Given a graph with nonnegative edge weights and node pairs Q, we study the problem of
constructing a minimum weight set of edges so that the induced subgraph contains at least K …

Hub location problems involve locating hub facilities and allocating demand nodes to hubs
in order to provide service between origin–destination pairs. In this study, we focus on cargo …

Run time distributions or time-to-target plots are very useful tools to characterize the running
times of stochastic algorithms for combinatorial optimization. We further explore run time …

Given a graph G with distinguished nodes s and t, a cost on each edge of G, and a fixed
integer L ≧ 2, the two edge-disjoint hop-constrained paths problem is to find a minimum …

The exploration of hybrid metaheuristics—combination of metaheuristics with concepts and
processes from other research areas—has been an important trend in combinatorial …

This article deals with the Two‐edge connected Hop‐constrained Network Design Problem
(or THNDP for short). Given a weighted graph G=(N, E), an integer L≥ 2, and a subset of …

In this paper, we study the k edge-connected L-hop-constrained network design problem.
Given a weighted graph G=(V, E), a set D of pairs of nodes, two integers L≥ 2 and k≥ 2, the …