This paper aims to provide an answer to the still open question, namely who should, if any, lead a marketing channel? To achieve this objective, we conside...

We consider an asymmetric duopoly producing a homogeneous commodity and facing a competitive demand. Our model incorporates two asymmetries. The first one i...

Coupling with the Modified-Grid Unconstrained Optimization Algorithm we introduced in our previous paper (Cheung and Ng, 1995), we have been able to develop...

The spatially inhomogeneous smoothness of the non-parametric density or regression-function to be estimated by non-parametric methods is often modelled by B...

Il est généralement reconnu que le processus de découpage électoral doit être à l'abri du gerrymandering et de l'intervention politique. L'utilisation de mé...

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