This paper studies a class of problems consisting of minimizing a continuously differentiable function penalizedwith the so-called `0-norm over a symmetric set. These problems are hard to solve, yet prominent in many fields and applications.We first study the proximal mapping with respect to the `0-norm over symmetric sets, and provide an efficient method to attainit. The method is ...

This paper describes an attribute based tabu search heuristic for the Generalized Minimum Spanning Tree Problem (GMSTP) known to be NP-hard. Given a graph whose vertex set is partitioned into clusters, the GMSTP consists of designing a minimum cost tree spanning all clusters. An attribute based tabu search heuristic employing new neighborhoods is proposed. An extended set of TSPLIB test instanc...

Tabu search is a "higher level" heuristic procedure for solving optimization problems, designed to guide other methods (or their component processes) to escape the trap of local optimality. Tabu search has obtained optimal and near optimal solutions to a wide variety of classical and practical problems in applications ranging from scheduling to telecommunications and from character recognition ...

This paper introduces a novel approach to performance refinement of a heuristic algorithm for combinatorial optimization. The proposed Adaptive Tabu Search (A–TS) algorithm introduces adaptive behavior in the traditional Tabu Search algorithm. The adaptive nature of this algorithm is based on two adaptive coefficients that drive the heuristic. Choosing appropriate values for these parameters ha...

This paper presents the solution quality analysis of a parallel tabu search algorithm for the task scheduling problem on heterogeneous processors under precedence constraints. We evaluate the achieved makespan reduction of diierent parallel applications relatively to the results obtained by the best greedy algorithm in the literature, as a function of parameters such as problem size, system het...

This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which service requests arrive in real time. The hybrid algorithm combines an exact constraint programming algorithm and a tabu search heuristic. An important component of the tabu search heuristic consists of three scheduling procedures which are executed sequentially. Experiments show that the constraint programmin...

In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu search based heuristic algorithm. The objective of the algorithm is to achieve the performance of full wavelength conversion in terms of minimizing the total number of fibers used in the network by placing minimum number of waveleng...

Abstract In this article, we extensively develop Carleman estimates for the wave equation and give some applications. We focus on the case of an observation of the flux on a part of the boundary satisfying the Gamma conditions of Lions. We will then consider two applications. The first one deals with the exact controllability problem for the wave equation with potential. Following the duality m...

We propose a dedicated tabu search algorithm (TSX_WDP) for the winner determination problem (WDP) in combinatorial auctions. TSX_WDP integrates two complementary neighborhoods designed respectively for intensification and diversification. To escape deep local optima, TSX_WDP employs a backbone-based recombination operator to generate new starting points for tabu search and to displace the searc...

A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu Search which aims to follow, as close as possible, Glover's basic approach. In order to cover a wide domain of possible solutions, our algorithm ®rst performs the diversi®cation: it locates the most promising areas, b...