Inicio Nosotros Búsquedas
Buscar en nuestra Base de Datos:     
Registro 1 de 1, Base de información BIBCYT Operations Research Letters ISSN:0167-6377
May 2009

Referencias Analíticas

* Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks Pretolani, Daniele ; Nielsen, Lars Relund ; Andersen, Kim Allan ; Ehrgott, Matthias pp. 201-205

* Pricing double-barrier options under a flexible jump diffusion model Cai, Ning ; Chen, Nan ; Wan, Xiangwei pp. 163-167

* On improving optimal oblivious routing Scutellà, Maria Grazia pp. 197-200

* On competitiveness in uniform utility allocation markets Chakrabarty, Deeparnab ; Devanur, Nikhil pp. 155-158

* On a time consistency concept in risk averse multistage stochastic programming erid Shapiro, Alexander pp. 143-147

* Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems Bläser, Markus ; Ram, L. Shankar ; Sviridenko, Maxim pp. 176-180

* Extended formulations for the cardinality constrained subtree of a tree problem Agra, A. ; Gouveia, L. ; Requejo, C. pp.192-196

* Existence and computation of optimal tolls in multiclass network equilibrium problems Marcotte, P. ; Zhu, D.L. pp. 211-214

* Dynamics of 2-worker bucket brigade assembly line with blocking and instantaneous walk-back Gurumoorthy, Karthik S. ; Paul, Anand ; Banerjee, Arunava pp. 159-162

* Convergence of SSOR methods for linear complementarity problems Dehghan, Mehdi ; Hajarian, Masoud pp. 219-223

* An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width Gluchshenko, Olga N. ; Tamir, Arie ; Hamacher, Horst W. pp. 168-170

* An edge-reduction algorithm for the vertex cover problem Han, Qiaoming ; Punnen, Abraham P. ; Ye, Yinyu pp. 181-186

* A general framework for cooperation under uncertainty Özen, Ulas ; Slikker, Marco ; Norde, Henk pp. 148-154

* A dynamic programming algorithm for the bilevel knapsack problem Brotcorne, Luce ; Hanafi, Saïd ; Mansi, Raïd pp. 215-218

* A dual algorithm for the minimum covering ball problem in Rn Dearing, P.M. ; Zeck, Christiane R. pp. 171-175

* A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes Frangioni, A. ; Gentile, C. pp. 206-210

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno

Generados por el servidor 'bibcyt.ucla.edu.ve' (3.147.66.178)
Adaptive Server Anywhere (07.00.0000)
ODBC
Sesión="" Sesión anterior=""
ejecutando Back-end Alejandría BE 7.0.7b0 ** * *
3.147.66.178 (NTM) bajo el ambiente Apache/2.2.4 (Win32) PHP/5.2.2.
usando una conexión ODBC (RowCount) al manejador de bases de datos..
Versión de la base de información BIBCYT: 7.0.0 (con listas invertidas [2.0])

Cliente: 3.147.66.178
Salida con Javascript


** Back-end Alejandría BE 7.0.7b0 *