Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 201
Volume 201, Number 1, December 2012
- Byeong Seok Ahn, S. H. Choi:
Aggregation of ordinal data using ordered weighted averaging operator weights. 1-16 - Xingzheng Ai, Jing Chen, Jianhua Ma:
Contracting with demand uncertainty under supply chain competition. 17-38 - Sandjai Bhulai
, Taoying Farenhorst-Yuan, Bernd Heidergott, Dinard van der Laan:
Optimal balanced control for call centers. 39-62 - József Bukszár, Gergely Mádi-Nagy, Tamás Szántai:
Computing bounds for the probability of the union of events by different methods. 63-81 - Kenneth Carling, Mengjie Han, Johan Håkansson:
Does Euclidean distance work well when the p-median model is applied in rural areas? 83-97 - Savas Dayanik, Semih Onur Sezer:
Multisource Bayesian sequential binary hypothesis testing problem. 99-130 - Luigi Di Puglia Pugliese, Francesca Guerriero:
A computational study of solution approaches for the resource constrained elementary shortest path problem. 131-157 - Guy Even, Alexander Zadorojniy:
Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks. 159-167 - Tomasz Gawronski:
Optimization of setup times in the furniture industry. 169-182 - Amandine Ghintran, Enrique González-Arangüena, Conrado Manuel:
A probabilistic position value. 183-196 - Sasthi C. Ghosh, Roger M. Whitaker, Stuart M. Allen, Steve Hurley:
Dynamic data resolution to improve the tractability of UMTS network planning. 197-227 - Michel Grabisch, Alexandre Skoda:
Games induced by the partitioning of a graph. 229-249 - Michel Grabisch, Peter Sudhölter:
The bounded core for games with precedence constraints. 251-264 - Evgeny Gurevsky, Olga Battaïa, Alexandre Dolgui:
Balancing of simple assembly lines under variations of task processing times. 265-286 - Xiangling Hu, Charles L. Munson, Stergios B. Fotopoulos:
Purchasing decisions under stochastic prices: Approximate solutions for order time, order quantity and supplier selection. 287-305 - Che Soong Kim, Vilena V. Mushko, Alexander N. Dudin:
Computation of the steady state distribution for multi-server retrial queues with phase type service process. 307-323 - Young Shin Kim, Rosella Giacometti, Svetlozar T. Rachev, Frank J. Fabozzi, Domenico Mignacca:
Measuring financial risk and portfolio optimization with a non-Gaussian multivariate model. 325-343 - Chaya Losada, Maria Paola Scaparra, Richard L. Church, Mark S. Daskin:
The stochastic interdiction median problem with disruption intensity levels. 345-365 - Mehrdad Mehrbod, Nan Tu, Lixin Miao, Dai Wenjing:
Interactive fuzzy goal programming for a multi-objective closed-loop logistics network. 367-381 - Francisco J. Rodríguez, Christian Blum, Carlos García-Martínez, Manuel Lozano:
GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. 383-401 - Mukesh Rungta, Gino J. Lim, M. Reza Baharnemati:
Optimal egress time calculation and path generation for large evacuation networks. 403-421 - Ruslan Sadykov:
Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost. 423-440 - Pritibhushan Sinha:
A random maintenance scheduling model to reduce fault diagnosis time. 441-447 - Tak Kuen Siu:
A BSDE approach to risk-based asset allocation of pension funds with regime switching. 449-473 - Kung-Jeng Wang, Yu-Siang Lin:
Optimal inventory replenishment strategy for deteriorating items in a demand-declining market with the retailer's price manipulation. 475-494
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-16 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
