All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 160

Showing per page

Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities

Samuel Deleplanque, Safia Kedad-Sidhoum, Alain Quilliot (2013)

RAIRO - Operations Research - Recherche Opérationnelle

The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to designing a Lagrangean based heuristic. Numerical experiments showing the efficiency of the proposed approach are...

Localización sobre redes estocásticas con criterio minisum.

José Muñoz Pérez (1982)

Trabajos de Estadística e Investigación Operativa

Se considera el problema de localización de centros de servicio sobre redes estocásticas, donde los puntos de demanda son cada uno de los puntos de los arcos, así como los nodos de la red y el tiempo de duración de los trayectos, sobre los arcos de la red, son variables aleatorias discretas con distribuciones de probabilidad conocidas. Bajo un conjunto particular de supuestos, se encuentra que siempre existe un conjunto de m puntos de la red que son puntos medios de los arcos, o nodos de la red,...

Location of polygon vertices on circles and its application in transport studies

Ján Černý, Filip Guldan (1987)

Aplikace matematiky

The paper deals with the problem how to locate a set of polygon vertices on given circles fulfilling some criteria of "regularity" of individual and composed polygons. Specifying the conditions we can obtain a lot of particular versions of this general problem. Some of them are already solved, the others are not. Applications of this theory can be found in scheduling of periodically repeating processes, e.g. in coordination of several urban lines on a common leg, in optimization of the rhythm of...

Maximization of distances of regular polygons on a circle

Filip Guldan (1980)

Aplikace matematiky

This paper presents the solution of a basic problem defined by J. Černý which solves a concrete everyday problem in railway and road transport (the problem of optimization of time-tables by some criteria).

Currently displaying 81 – 100 of 160