Resultats globals: 2 registres trobats en 0.02 segons.
Articles, 2 registres trobats
Articles 2 registres trobats  
1.
26 p, 871.8 KB A branch and bound method for stochastic global optimization / Norkin, Vladimir I. ; Pflug, Georg Ch. ; Ruszczynski, Andrzej
A stochastic branch and bound method for solving stochastic global optimization problems is proposed. As in the deterministic case, the feasible set is partitioned into compact subsets. To guide the partitioning process the method uses stochastic upper and lower estimates of the optimal value of the objective function in each subset. [...]
1998
Mathematical Programming, vol. 83 n. 3 (1998) p. 425-450  
 Accés restringit a la UAB
2.
13 p, 616.7 KB Duality theorem for a generalized Fermat-Weber problem / Kaplan, Wilfred ; Yang, Wei H.
The classical Fermat-Weber problem is to minimize the sum of the distances from a point in a plane to k given points in the plane. This problem was generalized by Witzgall to n-dimensional space and to allow for a general norm, not necessarily symmetric; he found a dual for this problem. [...]
1997
Mathematical Programming, vol. 76 n. 2 (1997) p. 285-297  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.