The asymptotic robustness of estimators as a function of a rarity parameter, in the context of rare-event simulation, is often qualified by properties such a...

We recall the use of squared slacks used to transform inequality constraints into equalities and several reasons why their introduction may be harmful in ...

In the <i>Vehicle Routing Problem </i> (VRP), the aim is to design a set of <i>m</i> minimum cost vehicle routes through <i>n</i> customer locations, so that...

Here we study hierarchical Bayesian estimation of a monotone hazard rate for both complete and randomly right censored data. We propose two methods of comp...

<p>The paper determines optimal pricing and advertising policies for an entertainment event, taking into account diffusion effects and a last-minute market...

<p>On étudie à l'aide du système AutoGraphiX 2 (AGX 2) des relations de la forme </p>

<p><center> <img src="/cgi-bin/mimetex.cgi?\underline{b}_{n} \, \l...

In Z. Ma, P.E. Caines, and R.P. Malhamé, ``Control of Loss Network Systems: Call Admission and Routing Control", (submitted to <i>SIAM J. Control...

In this paper the call admission control (CAC) and routing control (RC) problems for loss network systems are studied as optimal stochastic control (OSC) pr...

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...

This paper deals with the class of linear systems with random abrupt changes. The stochastic stability and the stochastic stabilization problems of t...

To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We...

In previous work, the generalized pattern search (GPS) algorithm for linearly constrained (continuous) optimization was extended to mixed variable problems...

Given a class of graphs <img src="/cgi-bin/mimetex.cgi?\mathcal{F}">, a forbidden subgraph characterization (FSC) is a set of graphs <img src="/cgi-bin/mimet...

Upper bounds for products of four measures of distances in graphs: diameter, radius, average eccentricity and remoteness with three measures of connectivity:...

In the set of all connected graphs with a given domination number, we characterize the graphs which achieve the maximum value of the spectral radius of the ...

We show that among connected graphs with maximum clique size <img src="/cgi-bin/mimetex.cgi?\omega">, the minimum value of the spectral radius of adjacency m...

Routing for Overlapping Segment Shared Protection (OSSP) in multi-domain networks is more difficult than that in single domain networks because of the scalab...

We present and compare three new compact linearizations for the quadratic 0-1 minimization problem, two of which achieving the same lower bound than the "sta...

This paper explores the design modelling issues of the Petaweb, an optical network architecture that provides fully meshed connectivity between electronic...

Circle packing problems were recently solved via reformulation descent (RD) by switching between a cartesian and a polar formulation. Mixed formulations, wi...