Given a set of <i>m</i> observations on <i>n</i> variables, an 0(<i>mn</i>²) algorithm is proposed to find a basis of all affine relations betwee...

By means of the variable neighborhood search algorithm, a newly designed heuristic approach to combinatorial optimization, we established the structure of t...

The purpose of this article is to formulate and solve a shortest loop problem associated with the design of material flow handling systems in factories. Th...

We study the problem of allocation over time of total cost incurred by countries in a cooperative game of pollution reduction. We compute the characteristi...

Cellular manufacturing is a promising approach for grouping efficiency in manufacturing systems. Although this problem has been extensively studied in the ...

This paper deals with the optimal production control problem in a stochastic two-machine flow shop. Our aim is to develop approximation techniques for deriv...

The probabilistic satisfiability problem consists, given <i>m</i> logical sentences, with their probabilities to find if they are coherent, and if it is the...

We discuss the relationship between probabilistic logic and <img src="pi.gif" align=bottom>-CMS. Given a set of logical sentences and probabilities, the ou...

In a graph <i>G</i>, a <i>k-club</i> is a vertex set inducing a subgraph of diameter <i>k</i>. These structures play an important role in several applicati...

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