Resultats globals: 2 registres trobats en 0.02 segons.
Articles, 2 registres trobats
Articles 2 registres trobats  
1.
11 p, 470.9 KB Plant location with minimum inventory / Barahona, Francisco ; Jensen, David
We present an integer programming model for plant location with inventory costs. The linear programming relaxation has been solved by Dantzig-Wolfe decomposition. In this case the subproblems reduce to the minimum cut problem. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 101-111  
 Accés restringit a la UAB
2.
20 p, 827.4 KB Constraint aggregation principle in convex optimization / Ermoliev, Yuri M. ; Kryazhimskii, Arkadii V. ; Ruszczynski, Andrzej
A general constraint aggregation technique is proposed for convex optimization problems. At each iteration a set of convex inequalities and linear equations is replaced by a single surrogate inequality formed as a linear combination of the original constraints. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 353-372  
 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.