A continuum of minimal pairs of compact convex sets which are not connected by translations.
Pallaschke, Diethard, Urbański, Ryszard (1996)
Journal of Convex Analysis
Jaroslav Hrouda (1971)
Aplikace matematiky
Aleksandar Zečević (1995)
The Yugoslav Journal of Operations Research
Yves Smeers (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Lê Dung Muu (1985)
Kybernetika
Alfonso Farina, Antonio Graziano, Francesca Mariani, Francesco Zirilli (2010)
RAIRO - Operations Research - Recherche Opérationnelle
A network of mobile cooperative sensors is considered. The following problems are studied: (1) the “optimal“deployment of the sensors on a given territory; (2) the detection of local anomalies in the noisy data measured by the sensors. In absence of an information fusion center in the network, from “local” interactions between sensors “global“solutions of these problems are found.
Alfonso Farina, Antonio Graziano, Francesca Mariani, Francesco Zirilli (2011)
RAIRO - Operations Research
A network of mobile cooperative sensors is considered. The following problems are studied: (1) the “optimal" deployment of the sensors on a given territory; (2) the detection of local anomalies in the noisy data measured by the sensors. In absence of an information fusion center in the network, from “local" interactions between sensors “global" solutions of these problems are found.
B.F. Sherman (1976/1977)
Numerische Mathematik
N. Gaffke, R. Mathar (1989)
Metrika
Alireza Amirteimoori, Feng Yang (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Data envelopment analysis (DEA) has been widely used to measure the performance of the operational units that convert multiple inputs into multiple outputs. In many real world scenarios, there are systems that have a two-stage network process with shared inputs used in both stages of productions. In this paper, the problem of evaluating the efficiency of a set of specialized and interdependent components that make up a large DMU is considered. In these processes the first stage consists of two parallel...
I. Papathanasiou, B. Manos, Μ. Vlachopoulou, I. Vassiliadou (2005)
The Yugoslav Journal of Operations Research
Amouzegar, Mahyar A., Jacobsen, Stephen E. (1998)
Journal of Applied Mathematics and Decision Sciences
Senne, Edson Luiz França, Pereira, Marcos Antonio, Lorena, Luiz Antonio Nogueira (2010)
Advances in Operations Research
E. Steingrimsson (1994)
Discrete & computational geometry
Hasan, M.Babul, Raffensperger, John F. (2007)
Journal of Applied Mathematics and Decision Sciences
Michael Krätzschmar (1989)
Numerische Mathematik
Zaslavski, Alexander J. (2006)
International Journal of Mathematics and Mathematical Sciences
Mustapha Ç. Pinar (2003)
RAIRO - Operations Research - Recherche Opérationnelle
A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemaréchal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lovász number.
Mustapha Ç. Pinar (2010)
RAIRO - Operations Research
A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemaréchal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lovász θ number.
Pham Kieu (1974)
Kybernetika