3170 results — page 146 of 159

and

In this paper we develop a stochastic, dynamic network equilibrium model of airline passenger transportation. The model explicitly incorporates the behavior...

BibTeX reference
, , , and

Because of the transmission of disease producing parasites to man and animals and the nuisance caused by bites from adult black flies, they are the object o...

BibTeX reference
, , , and

CREW-OPT is a new software module in the HASTUS family of scheduling software. CREW-OPT produces optimal or near-optimal crew schedules for small problems (...

BibTeX reference
, , and

Timonov proposes an algorithm for global maximization of univariate Lipschitz functions in which successive evaluation points are chosen in order to ensure ...

BibTeX reference

The concept of lexicographic sum of ordered sets and relational structures admits an algebraic analogue. In the case of hypergroups, this is used to general...

BibTeX reference
, , and

We study in this paper the application of simulated annealing and tabu search in the solution of the clique partitioning problem. We illustrate the effectiv...

BibTeX reference
, , and

Divisive hierarchical clustering algorithms with the diametercriterion proceed by recursively selecting the cluster with largest diameter and partitioning i...

BibTeX reference
, , and

Le problème classique de dimensionnement d'un réseau de télécommunications se formule en général comme suit: étant donné un réseau, une matrice de trafic et...

BibTeX reference
and

New tour improvement heuristics are described and studied from the point of view of their performance on random and real instances. They are compared to the...

BibTeX reference
and

Ce rapport présente deux modèles illustrant l'évolution à long terme, des systèmes de production d'électricité des régions de l'Ontario et de la Nouvelle-An...

BibTeX reference
and

Consider a flow-shop with m processors and <i>n</i> jobs, whose processing times are state dependent. Since the state often also depend on the sequence, a h...

BibTeX reference
, , and

We study the complexity and propose an algorithm for the problem of determining, given <i>p</i> vectors of {-1, 1}<i><sup>n</sup></i>, all linear combinatio...

BibTeX reference

Consider <i>N</i> entities to be classified, with given weights, and a matrix of dissimilarities between pairs of them. The split of a cluster is the small...

BibTeX reference
, , , and

This paper deals with a decomposition technique for linear programs which proposes a new treatment of the master program in the classical Dantzig-Wolfe algo...

BibTeX reference
and

In this paper we study the infinite-horizon optimal control of linear stochastic systems with quadratic cost integrand.

BibTeX reference

In this paper, we suggest an approximation procedure for the solution of two-player zero-sum stochastic games with continuous state and action spaces simila...

BibTeX reference
, , and

We show in this paper how set partitioning formulation and column generation techniques can be used to model and solve to optimality large scale vehicle rou...

BibTeX reference

The concept of moduloïd over a dioïd has been introduced in M. Gondran and M. Minoux [8] for the algebraic structure left invariant under the action of a ma...

BibTeX reference
and

In this paper we address the problem of simultaneously selecting the composition and routing of a fleet of vehicles in order to efficiently service customer...

BibTeX reference
and

The problem of two processors in series and <i>n</i> parts is considered, when processing times depend on some state variable. It is first shown that the mi...

BibTeX reference