3176 résultats — page 146 de 159

, et

The problem of optimal location and sizing of off-shore platforms for oil exploration can be formulated as follows: given a set of oil wells to be drilled a...

référence BibTeX
, et

The vehicle routing problem with time windows (VRPTW) is a generalization of the vehicle routing problem where the service of a customer can begin within th...

référence BibTeX
et

In this paper, the problem of optimally locating the numbers around a dart board is investigated. The objective considered is risk maximization. Under diffe...

référence BibTeX

This paper considers a flexible manufacturing system for several products, each requiring a number of sequential non-preemptive tasks, some of which may be...

référence BibTeX
et

The development of truck dispatching systems has during recent years taken two directions. One has been systems using mathematical optimization and powerfu...

référence BibTeX
et

In this paper we propose a path-following, or short-step, version of Karmarkar's algorithm for the primal and for the dual problems. We show it to converge ...

référence BibTeX
et

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

référence BibTeX
, , et

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

référence BibTeX
, , et

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

référence BibTeX

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

référence BibTeX

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

référence BibTeX
, et

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

référence BibTeX

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

référence BibTeX
, et

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

référence BibTeX
et

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

référence BibTeX
et

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

référence BibTeX
et

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

référence BibTeX

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

référence BibTeX

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

référence BibTeX
, , et

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

référence BibTeX