Mathematical Methods of Operations Research

1997 - 2025

Current editor(s): Oliver Stein

From:
Springer
Gesellschaft für Operations Research (GOR)
Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 57, issue 3, 2003

Stability estimates in the problem of average optimal switching of a Markov chain pp. 345-365

Evgueni Gordienko and Alexander Yushkevich

Control policy of a hysteretic queueing system pp. 367-376

Lotfi Tadj and Jau-Chuan Ke

Differential and sensitivity properties of gap functions for vector variational inequalities pp. 377-391

S. J. Li, Hong Yan and G. Y. Chen

Strong convergence of a proximal-based method for convex optimization pp. 393-407

Vadim Azhmyakov and Werner H. Schmidt

Upper semicontinuity of closed-convex-valued multifunctions pp. 409-425

Maria J. Cánovas, Marco A. López, Eva-Maria Ortega and Juan Parra

Characterizations of convex and quasiconvex set-valued maps pp. 427-435

Joël Benoist and Nicolae Popovici

Degeneracy degrees of constraint collections pp. 437-448

Gerard Sierksma and Gert A. Tijssen

The average behaviour of greedy algorithms for the knapsack problem: General distributions pp. 449-479

Gennady Diubin and Alexander Korbut

Cooperation and competition in inventory games pp. 481-493

Ana Meca, Ignacio García-Jurado and Peter Borm

Semiproportional values for TU games pp. 495-511

Anna B. Khmelnitskaya and Theo S. H. Driessen

Scheduling a batch processing machine with bipartite compatibility graphs pp. 513-527

Mourad Boudhar

Volume 57, issue 2, 2003

Movement minimization for unit distances in conveyor flow shop processing pp. 173-206

W. Espelage and E. Wanke

Asymptotic strong determination in integer programming: Quasi dual method pp. 207-216

Yifan Xu

Non-preemptive two-machine open shop scheduling with non-availability constraints pp. 217-234

J. Breit, G. Schmidt and V. A. Strusevich

The operating characteristic analysis on a general input queue with N policy and a startup time pp. 235-254

Jau-Chuan Ke

Optimal control of an M/H k /1 queueing system with a removable server pp. 255-262

Kuo-Hsiung Wang and Kuo-Liang Yen

Solution to the risk-sensitive average cost optimality equation in a class of Markov decision processes with finite state space pp. 263-285

Rolando Cavazos-Cadena

On the balancedness of relaxed sequencing games pp. 287-297

Bas van Velzen and Herbert Hamers

Discretization of information collecting situations and continuity of compensation rules pp. 299-308

R. Brânzei, F. Scotti, S. Tijs and A. Torre

A cooperative treatment of an n-person cost-goal-game pp. 309-319

Werner Krabs

Sensitivity analysis of a sequential decision problem with learning pp. 321-327

Alfred Müller and Marco Scarsini

A transfer/clearing inventory model under sporadic review pp. 329-344

Oded Berman, Dmitry Krass and David Perry

Volume 57, issue 1, 2003

The critical discount factor for finite Markovian decision processes with an absorbing set pp. 1-19

K. Hinderer and K.-H. Waldmann

Whittle's index policy for a multi-class queueing system with convex holding costs pp. 21-39

P. S. Ansell, K. D. Glazebrook, J. Niño-Mora and M. O'Keeffe

Using an adaptive genetic algorithm with reversals to find good second-order multiple recursive random number generators pp. 41-48

Hui-Chin Tang

Axiomatizations of the Shapley value for cooperative games on antimatroids pp. 49-65

E. Algaba, J. M. Bilbao, Rene van den Brink and A. Jiménez-Losada

Semi-infinite assignment problems and related games pp. 67-78

Natividad Llorca, Stef Tijs and Judith Timmer

Minimizing risk models in stochastic shortest path problems pp. 79-88

Yoshio Ohtsubo

Characterizing generalized trade-off directions pp. 89-100

Kaisa Miettinen and Marko M. Mäkelä

A parametric characterization of local optimality pp. 101-109

Mirjam Dür

Scheduling chains on a single machine with non-negative time lags pp. 111-123

Alix Munier and Francis Sourd

Bayesian analysis of Markov Modulated Bernoulli Processes pp. 125-140

S. Özekici and R. Soyer

A minimax rule for portfolio selection in frictional markets pp. 141-155

Shou-Yang Wang, Y. Yamamoto and Mei Yu

Optimal bid strategies for electricity auctions pp. 157-171

Juri Hinz

Volume 56, issue 3, 2003

Tree-sparse convex programs pp. 347-376

Marc C. Steinbach

Some properties of the core on convex geometries pp. 377-386

Yoshio Okamoto

Approximation algorithms for the traveling salesman problem pp. 387-405

Jérôme Monnot, Vangelis Th. Paschos and Sophie Toulouse

A polynomial algorithm for P | p j =1, r j, outtree | ∑ C j pp. 407-412

Peter Brucker, Johann Hurink and Sigrid Knust

Unbiased approximation in multicriteria optimization pp. 413-437

Kathrin Klamroth, Jørgen Tind and Margaret M. Wiecek

Monotonic allocation schemes in clan games pp. 439-449

Mark Voorneveld, Stef Tijs and Sofia Grahn

The optimality equation and ε-optimal strategies in Markov games with average reward criterion pp. 451-471

Heinz-Uwe Küenle and Ronald Schurath

Solution to the risk-sensitive average optimality equation in communicating Markov decision chains with finite state space: An alternative approach pp. 473-479

Rolando Cavazos-Cadena and Daniel Hernández-Hernández

Optimality of randomized strategies in a Markovian replacement model pp. 481-499

Peter Bruns

New light on the portfolio allocation problem pp. 501-511

R. A. Maller and D. A. Turkington

Project scheduling with inventory constraints pp. 513-533

Klaus Neumann and Christoph Schwindt

Book Reviews pp. 535-536

M. Teresa Melo

Book Reviews pp. 537-538

Justo Puerto

Book Reviews pp. 539-540

Bettina Klinz

Volume 56, issue 2, 2002

A pricing methodology for resource allocation and routing in integrated-services networks with quality of service requirements pp. 151-167

Tudor Mihai Stoenescu and Demosthenis Teneketzis

Cost analysis of a finite M/M/R queueing system with balking, reneging, and server breakdowns pp. 169-180

Kuo-Hsiung Wang and Ying-Chung Chang

Value iteration and approximately optimal stationary policies in finite-state average Markov decision chains pp. 181-196

Rolando Cavazos-Cadena and Rolando Cavazos-Cadena

Univariate cubic L 1 splines – A geometric programming approach pp. 197-229

Hao Cheng, Shu-Cherng Fang and John E. Lavery

Superlinear/quadratic one-step smoothing Newton method for P 0 -NCP without strict complementarity pp. 231-241

Liping Zhang and Ziyou Gao

On the stability of the linear Skorohod problem in an orthant pp. 243-258

Ahmed El Kharroubi, Abdelghani Ben Tahar and Abdelhak Yaacoubi

Generalized vector equilibrium problems with set-valued mappings pp. 259-268

Jun-Yi Fu and An-Hua Wan

The Chi-compromise value for non-transferable utility games pp. 269-286

Gustavo Bergantiños and Jordi Masso

The Shapley value for games on matroids: The dynamic model pp. 287-301

J. M. Bilbao, T. S. H. Driessen, A. Jiménez-Losada and E. Lebrón

Subgame perfect equilibria in model with bargaining costs varying in time pp. 303-313

Agnieszka Rusinowska

Optimality in different strategy classes in zero-sum stochastic games pp. 315-322

J. Flesch, F. Thuijsman and O. J. Vrieze

Cost allocation in shortest path games pp. 323-340

Mark Voorneveld and Sofia Grahn

Book Reviews pp. 341-342

Thomas Hanne

Book Reviews pp. 343-344

Francesco Maffioli

Book Reviews pp. 345-345

Stefan Nickel

Volume 56, issue 1, 2002

Preface pp. 1-2

Michael Jünger, Rüdiger Schultz and Robert Weismantel

An Attractor-Repeller approach to floorplanning pp. 3-27

Miguel F. Anjos and Anthony Vannelli

Exponential irreducible neighborhoods for combinatorial optimization problems pp. 29-44

Robert T. Firla, Bianca Spille and Robert Weismantel

Stable multi-sets pp. 45-65

Arie M. C. A. Koster and Adrian Zymolka

Primal cutting plane algorithms revisited pp. 67-81

Adam N. Letchford and Andrea Lodi

A bicriteria stochastic programming model for capacity expansion in telecommunications pp. 83-100

Morten Riis and Jørn Lodahl

On dual minimum cost flow algorithms pp. 101-126

Jens Vygen

Rank-perfect and" weakly rank-perfect graphs pp. 127-149

Annegret K. Wagler