Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Methods of Operations Research, Volume 57
Volume 57, Number 1, April 2003
- Karl Hinderer, Karl-Heinz Waldmann:
The critical discount factor for finite Markovian decision processes with an absorbing set. 1-19 - P. S. Ansell, Kevin D. Glazebrook, José Niño-Mora
, M. O'Keeffe:
Whittle's index policy for a multi-class queueing system with convex holding costs. 21-39 - Hui-Chin Tang:
Using an adaptive genetic algorithm with reversals to find good second-order multiple recursive random number generators. 41-48 - Encarnación Algaba Durán, Jesús Mario Bilbao, René van den Brink, Andrés Jiménez-Losada:
Axiomatizations of the Shapley value for cooperative games on antimatroids. 49-65 - Natividad Llorca, Stef Tijs, Judith Timmer:
Semi-infinite assignment problems and related games. 67-78 - Yoshio Ohtsubo:
Minimizing risk models in stochastic shortest path problems. 79-88 - Kaisa Miettinen, Marko M. Mäkelä:
Characterizing generalized trade-off directions. 89-100 - Mirjam Dür:
A parametric characterization of local optimality. 101-109 - Alix Munier, Francis Sourd:
Scheduling chains on a single machine with non-negative time lags. 111-123 - Süleyman Özekici, Refik Soyer:
Bayesian analysis of Markov Modulated Bernoulli Processes. 125-140 - Shouyang Wang, Yoshitsugu Yamamoto, Mei Yu:
A minimax rule for portfolio selection in frictional markets. 141-155 - Juri Hinz:
Optimal bid strategies for electricity auctions. 157-171
Volume 57, Number 2, May 2003
- Wolfgang Espelage, Egon Wanke:
Movement minimization for unit distances in conveyor flow shop processing. 173-206 - Yifan Xu:
Asymptotic strong determination in integer programming: Quasi dual method. 207-216 - Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Non-preemptive two-machine open shop scheduling with non-availability constraints. 217-234 - Jau-Chuan Ke:
The operating characteristic analysis on a general input queue with N policy and a startup time. 235-254 - Kuo-Hsiung Wang, Kuo-Liang Yen:
Optimal control of an M/Hk/1 queueing system with a removable server. 255-262 - Rolando Cavazos-Cadena:
Solution to the risk-sensitive average cost optimality equation in a class of Markov decision processes with finite state space. 263-285 - Bas van Velzen, Herbert Hamers:
On the balancedness of relaxed sequencing games. 287-297 - Rodica Branzei, Fernanda Scotti, Stef Tijs, Anna Torre:
Discretization of information collecting situations and continuity of compensation rules. 299-308 - Werner Krabs:
A cooperative treatment of an n-person cost-goal-game. 309-319 - Alfred Müller, Marco Scarsini:
Sensitivity analysis of a sequential decision problem with learning. 321-327 - Oded Berman, Dmitry Krass, David Perry:
A transfer/clearing inventory model under sporadic review. 329-344
Volume 57, Number 3, August 2003
- Evgueni Gordienko, Alexander Yushkevich:
Stability estimates in the problem of average optimal switching of a Markov chain. 345-365 - Lotfi Tadj, Jau-Chuan Ke:
Control policy of a hysteretic queueing system. 367-376 - S. J. Li, Hong Yan, Guang-Ya Chen:
Differential and sensitivity properties of gap functions for vector variational inequalities. 377-391 - Vadim Azhmyakov, Werner H. Schmidt:
Strong convergence of a proximal-based method for convex optimization. 393-407 - María J. Cánovas, Marco A. López, Eva-María Ortega, Juan Parra:
Upper semicontinuity of closed-convex-valued multifunctions. 409-425 - Joël Benoist, Nicolae Popovici:
Characterizations of convex and quasiconvex set-valued maps. 427-435 - Gerard Sierksma, Gert A. Tijssen:
Degeneracy degrees of constraint collections. 437-448 - Gennady Diubin, Alexander Korbut:
The average behaviour of greedy algorithms for the knapsack problem: General distributions. 449-479 - Ana Meca, Ignacio García-Jurado, Peter Borm:
Cooperation and competition in inventory games. 481-493 - Anna B. Khmelnitskaya, Theo S. H. Driessen:
Semiproportional values for TU games. 495-511 - Mourad Boudhar:
Scheduling a batch processing machine with bipartite compatibility graphs. 513-527
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-08-18 21:46 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:
