3237 résultats — page 136 de 162

, et

This paper deals with the problem of how to render the jump linear quadratic (JLQ) control robust. Mainly, we present sufficient conditions for quadratic st...

référence BibTeX
, et

We present a new method for minimizing the sum of a convex function and a product of <i>k</i> nonnegative convex functions over a convex set. This problem i...

référence BibTeX
et

In this paper, we address the optimal control issues corresponding to the planning of the production rate and maintenance rate of a failure prone manufactur...

référence BibTeX
, et

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/...

référence BibTeX
et

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...

référence BibTeX
et

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

référence BibTeX
, , et

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

référence BibTeX
, et

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...

référence BibTeX
, et

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...

référence BibTeX
et

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

référence BibTeX

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...

référence BibTeX
, et

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...

référence BibTeX
, et

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...

référence BibTeX
, et

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...

référence BibTeX
et

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

référence BibTeX
, , et

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

référence BibTeX

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

référence BibTeX
et

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...

référence BibTeX
, et

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...

référence BibTeX
, et

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...

référence BibTeX