3083 results — page 108 of 155

and

In this paper, we describe <i>H</i>-differentials of some well known NCP functions and their merit functions. We show how, under appropriate conditions on ...

BibTeX reference

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...

BibTeX reference
, , and

This paper addresses the guaranteed cost control problem of jump linear systems with norm bounded uncertain parameters. A time-multiplied performance index ...

BibTeX reference
, , and

The paper considers a channel of distribution consisting of a single manufacturer and retailer. The manufacturer advertises in national media, to build up t...

BibTeX reference
and

The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...

BibTeX reference

A survey is made of computer systems which help to obtain and sometimes provide automatically proofs, conjectures and refutations in graph theory.

BibTeX reference
, , and

The complexity status of the maximum stable set problem in the class of <i>P</i><sub>5</sub>-free graphs is unknown. In this paper, we first propose a chara...

BibTeX reference

Call and put options embedded in bonds are of American-style, and cannot be priced in a closed-form. In this paper, we formulate the problem of pricing thes...

BibTeX reference
, , and

This paper investigates several questions related to the location of facilities in multi-storey buildings in the presence of lifts. Where should facilities ...

BibTeX reference
, , and

The maximum stable set problem is NP-hard, even when restricted to <i>banner</i>-free graphs. In this paper, we use the augmenting graph approach to attack ...

BibTeX reference
, , and

In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. O...

BibTeX reference
and

Minimum <i>k</i>-cardinality tree problem on graph <i>G</i> consists in finding a subtree of <i>G</i> with exactly <i>k</i> edges whose sum of weights is mi...

BibTeX reference
and

A management decision based on voting by a team of experts has been commonly used and has been examined by the social scientists. Various approaches have be...

BibTeX reference
, , and

This paper investigates a new variation in the continuous single facility location problem. Specifically, we address the problem of locating a new facility...

BibTeX reference
and

We propose a Genetic Algorithm for scheduling multiprocessor tasks in multi-stage flow-shop environments. We present two special crossover operators that we...

BibTeX reference
and

Exploiting an overlooked observation of Blum, Kiefer & Rosenblatt (1961), Dugué (1975) and Deheuvels (1981a) described a decomposition of empirical distribu...

BibTeX reference
, , , , and

Dans le cadre des préoccupations croissantes pour la protection de l'environnement et la gestion économique de l'élimination des déchets, nous présentons un...

BibTeX reference
, , and

This paper introduces new rank-based statistics for testing against serial dependence in a univariate time series context. These Kolmogorov-Smirnov and Cram...

BibTeX reference
, , , and

This paper considers stochastic stability and stochastic stabilizability of linear discrete-time systems with Markovian jumps and mode-dependent time-delays...

BibTeX reference

We consider the problem of minimizing makespan in a no-wait flow-shop with three machines. Lot streaming (lot sizing) is the process of creating sublots t...

BibTeX reference