Given a network modeled by a probabilistic graph <i>G =</i> (<i>V,E</i>) with bounds on the operation probabilities of edges and of pairs of edges, the seco...

Solving exactly large instances of the channel assignment problem often requires to solve large linear programs with respect to the number of columns or row...

We present a survey of nondifferentiable optimization problems and methods with special focus on the analytic center cutting plane method. We propose a self...

A hedger of a contingent claim may decide to partially replicate on some states of nature and not on the others: A partial hedge initially costs less than a...

The recently developed Variable Neighborhood Search (VNS) meta-heuristic for combinatorial and global optimization is outlined together with its specializat...

The chemical trees on <i>n</i> vertices (= molecular graphs representing alkanes with <i>n</i> carbon atoms) with minimal, second-minimal, third-minimal, ma...

Let <i>G</i> be a connected graph and let <i>D</i> be its diameter. Denote by <i>d</i>(<i>G,k</i>) the number of pairs of vertices in <i>G</i> that are at d...

In this paper we develop robustness bounds for sampled-data linear time-delay systems. The uncertainty is assumed to be on both the <i>A</i> and <i>B</i> ma...

The cell-loss ratio at a given node in an ATM switch, defined as the steady-state fraction of packets of information that are lost at that node due to buffe...

This paper deals with the inventory-production control problem where the produced items are assumed to deteriorate with a rate that depends on the demand ra...

In this paper, the mixed \(H_2 / H_\infty\) control problem for continuous-time Markovian jumping linear systems using state-feedback control is considere...

Roadway snow and ice control (RSIC) is one of the most complex and fascinating venues for arc routing applications. Arc routing problems occur in several di...

Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...

In this paper we study the role of order releases and product mix coordination in a complex manufacturing line with batch processors. We develop a planning ...

Rotating schedules are commonly used in a number of industries and public services where employees work round the clock, seven days a week. Several rules g...

We present a branch and cut algorithm that yields in finite time, a globally <img src="epsilon.gif" align=bottom>-optimal (with respect to feasibility and o...

An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...

We consider a resource constrained shortest path problem in acyclic graphs, where resource windows are associated with the arcs, while lower and upper thres...

The problem of assigning locomotives and cars to trains is a complex task for most railways. In this paper, we propose a multi-commodity network flow based ...

Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...