We present several versions of a tabu search algorithm for the Steiner tree problem in graphs. A basic tabu search heuristic and versions with radical and/...

A government wishes to accelerate the adoption of a new technology in order to gradually replace an older one. The new technology is manufactured by a mono...

This paper deals with the robustness of the class of nonlinear systems with Markovian jumping parameters and unknown but bounded uncertainties. Under the as...

D.-c. programming is a recent technique of global optimization, which allows the solution of problems whose objective function and constraints can be expres...

In this paper, we deal with the robust stabilizability of the class of uncertain linear time-delay systems with Markovian jumping parameters and unknown but...

In this paper we study a class of optimal stochastic control problems involving two different time scales. The fast mode of the system is represented by det...

The paper presents three parallel versions of a column generation software applied to very large airline planning problems. The algorithms were implemented...

We study links between the bilevel linear and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a...

In this paper we derive lower bounds on the size of a minimum cover of a graph <i>G</i> by computing packings of edges, odd cycles and cliques of <i>G</i> o...

Estimation of the mean of a multivariate normal distribution is considered. The components of the mean vector are assumed to be intra-block exchangeable; t...

In this paper we tackle the problem of jointly finding the optimal location of the ATM switches, the topology of the backbone and local access networks, the...

This paper deals with the robustness of the class of discrete time linear systems with markovian jumping parameters and unknown but bounded uncertainties. U...

The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them. The approach applies a pote...

Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...

The <i>p</i>-maxisum dispersion problem consists of locating <i>p</i> facilities at vertices of a network in order to maximize the sum of the distances betw...

A new location-allocation problem, called <i>p</i>-Center-Sum, is considered: given <i>n</i> clients (or demand points) locate <i>p</i> facilities among a g...

Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simu...

Local descent methods typically employ a single neighbourhood structure to conduct the search around a candidate solution. In this paper, we propose a metho...

A new category of Tabu search, Chain-interchange heuristic method is proposed in this paper. It can be viewed as a Tabu search method adopted for a large c...

Weber's problem is to locate a facility in order to minimize the sum of its weighted distances to <i>n</i> fixed demand points. On a sphere, this problem i...