Brève communication. Performance du gradient réduit généralisé avec une méthode quasi newtonienne pour la programmation non linéaire
Brève communication. Programme en nombres entiers sans contraintes : génération des optimums locaux dans le cas quadratique
Brève communication. Théorème de conservation des clients dans les files d'attente
Brève communication. Transformation du problème de partitionnement en un problème d'ensemble stable de poids maximal
Brève communication. Une méthode de résolution des problèmes de col
Brèves communications. 0-1 optimization and non-linear programming
Brèves communications. Programmation entière non linéaire
Brèves communications. Une condition d'optimalité en programmation en nombres entiers
Bundle-based decomposition : conditions for convergence
-minimal pairs of compact convex sets.
C1,1 vector optimization problems and Riemann derivatives
Calcul des idéaux d'un ordonné fini
Calculating the variance in Markov-processes with random reward.
In this article we present a generalization of Markov Decision Processes with discreet time where the immediate rewards in every period are not deterministic but random, with the two first moments of the distribution given.Formulas are developed to calculate the expected value and the variance of the reward of the process, formulas which generalize and partially correct other results. We make some observations about the distribution of rewards for processes with limited or unlimited horizon and...
Calculus of the estimators of linear quantile regression by the method ACCPM.
Canonical greedy algorithms and dynamic programming
CAPS in Z(2,n)
We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.
Caractérisation de la convergence au sens de Mosco en terme d'approximations inf-convolutives
Caractérisation d'une solution optimale au problème de Monge-Kantorovitch
Caracterización algebraica de las aristas infinitas en el conjunto dual factible de un PSI-lineal.
Las propiedades geométricas del conjunto factible del dual de un problema semiinfinito lineal son análogas a las correspondientes para el caso finito. En este trabajo mostramos cómo, a partir de la caracterización algebraica de vértices y direcciones extremas, se consigue la correspondiente para aristas infinitas, estableciéndose así las bases para una extensión del método simplex a programas semiinfinitos lineales.
Cell Modelling of Hematopoiesis
In this work, we introduce a new software created to study hematopoiesis at the cell population level with the individually based approach. It can be used as an interface between theoretical works on population dynamics and experimental observations. We show that this software can be useful to study some features of normal hematopoiesis as well as some blood diseases such as myelogenous leukemia. It is also possible to simulate cell communication and the formation of cell colonies in the bone marrow. ...