Annals of Operations Research

1997 - 2025

Current editor(s): Endre Boros

From Springer
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 85, month 1, 1999

Planning under uncertainty pp. 0-0

G.B. Dantzig

Duality and optimality in multistagestochastic programming pp. 1-19

R.T. Rockafellar

The use of discrete moment bounds in probabilisticconstrained stochastic programming models pp. 21-38

András Prékopa

Stochastic integer programming:General models and algorithms pp. 39-57

Willem Klein Haneveld and Maarten van der Vlerk

Stochastic programs and statistical data pp. 59-78

Georg Pflug

Statistical estimation from an optimization viewpoint pp. 79-101

Roger Wets

Bound‐based approximations in multistage stochasticprogramming: Nonanticipativity aggregation pp. 103-127

N.C.P. Edirisinghe

Gains and costs of informationin stochastic programming pp. 129-152

Zvi Artstein

Some advances in decomposition methodsfor stochastic linear programming pp. 153-172

Andrzej Ruszczynski

Statistical approximations forstochastic linear programming problems pp. 173-193

Julia Higle and Suvrajeet Sen

Growth versus security tradeoffs indynamic investment analysis pp. 193-225

Leonard MacLean and William Ziemba

Scenario modeling for the management ofinternational bond portfolios pp. 227-247

Andrea Beltratti, Andrea Consiglio and Stavros Zenios

Linking strategic and tactical planning systemsfor asset and liability management pp. 249-266

John Mulvey, Chris Madsen and François Morin

The practice of portfolio replication. A practical overview of forward and inverse problems pp. 267-284

Ron Dembo and Dan Rosen

Volume 84, month 12, 1998

Preface pp. 0-0

García-Jurado, Federico Valenciano and Winter

Nash equilibrium in multiparty competitionwith “stochastic” voters pp. 3-27

Norman Schofield, Itai Sened and David Nixon

A comparative overview ofcryptographic voting protocols pp. 29-43

Hannu Nurmi and Arto Salomaa

The Spanish electoral system:Proportionality and governability pp. 45-59

M.L. Márquez and V. Ramírez

Extension of values to games withmultiple alternatives pp. 63-78

Redhwan Amer, F. Carreras and A. Magaña

Probabilistic values on convex geometries pp. 79-95

J.M. Bilbao, E. Lebrón and N. Jiménez

Complete games with minimum pp. 97-109

J. Freixas and M.A. Puente

On the intersection between the imputation setand the Weber set pp. 111-120

Javier Martínez-de-Albéniz and Carles Rafels

On extreme points of the core and reduced games pp. 121-133

Marina Núñez and Carles Rafels

General aggregation of demandand cost sharing methods pp. 137-164

Stef Tijs and Maurice Koster

Credible equilibria in non-finite games and ingames without perfect recall pp. 167-185

P. Corcho Sánchez and José Luis Ferreira

Unilateral commitment in the finitely repeated prisoners' dilemma pp. 187-194

Andrés Faíña-Medín, Ignacio García-Jurado, José Méndez-Naya and Luciano Méndez-Naya

Two-person non-zero-sum gamesas multicriteria goal games pp. 195-208

F.R. Fernández, J. Puerto and L. Monroy

Cooperative solutions in an economic growth game pp. 209-230

Carlos González-Alcón, Joaquín Sicilia and José Álvarez

On the structure of the set of Nash equilibriaof weakly nondegenerate bimatrix games pp. 231-238

Hans Keiding

Volume 83, month 10, 1998

Preface pp. 0-0

Heidemarie Bräsel and Frank Werner

On the solution region for certainscheduling problems with preemption pp. 1-22

Heidemarie Bräsel and Natalia Shakhlevich

Batch scheduling with deadlines on parallel machines pp. 23-40

Peter Brucker, Mikhail Kovalyov, Yakov Shafransky and Frank Werner

Jackson's Pseudo Preemptive Schedule for the Pm/r i, q i /C max scheduling problem pp. 41-58

J. Carlier and E. Pinson

Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time pp. 59-76

H.A.J. Crauwels, A.M.A. Hariri, C.N. Potts and L.N. Van Wassenhove

On the boolean-quadric packinguncapacitated facility-location polytope pp. 77-94

Jill Hardin, Jon Lee and Janny Leung

Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations pp. 95-114

Adam Janiak and Marie-Claude Portmann

Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints pp. 115-136

Klaus Neumann and Jürgen Zimmermann

Parallel branch-and-bound methods for thejob-shop scheduling problem pp. 137-160

Michael Perregaard and Jens Clausen

Practical job shop scheduling pp. 161-178

J.M.J. Schutten

Nonstrict vector summationin multi-operation scheduling pp. 179-212

Sergey Sevastianov

On the calculation of the stability radiusof an optimal or an approximate schedule pp. 213-252

Yuri Sotskov, Albert Wagelmans and Frank Werner

A greedy open shop heuristic with job priorities pp. 253-270

V.A. Strusevich

Decomposition in single-machine scheduling pp. 271-287

Wlodzimierz Szwarc

Volume 82, month 8, 1998

Modelling - In memory of Åsa Hallefjord pp. 0-0

Stein Wallace

Work patterns in project scheduling pp. 1-8

Åsa Hallefjord and Stein Wallace

A project scheduling methodology derivedas an analogue of digital circuit technology pp. 9-28

Gary Knotts, Moshe Dror and Bruce Hartman

The studio approach toteaching the craft of modeling pp. 29-48

Stephen Powell

Teaching mathematical modellingto business students pp. 49-58

Snjólfur Ólafsson

Restricted attention, myopic play, and thelearning of equilibrium pp. 59-82

Sjur Flåm

Option theory and modeling under uncertainty pp. 59-82

Daniel Christiansen and Stein Wallace

A class of stochastic programs withdecision dependent random elements pp. 83-106

Tore Jonsbråten, Roger Wets and David Woodruff

Modelling support for stochastic programs pp. 107-138

H.I. Gassmann

Network modeling of international financialequilibria with hedging pp. 139-160

Anna Nagurney and Stavros Siokos

Modelling aspects of distributed processingin telecommunication networks pp. 161-185

Asgeir Tomasgard, Jan Audestad, Shane Dye, Leen Stougie, Maarten van der Vlerk and Stein Wallace

Using dynamic models in management pp. 185-203

Pedro Mendes and Konstantinos Triantis

Efficiency and the logit model pp. 203-218

Sven Erlander

The traveling salesman game: An application ofcost allocation in a gas and oil company pp. 203-218

Stefan Engevall, Maud Göthe-Lundgren and Peter Värbrand

Optimizing simulation models of agricultural systems pp. 219-232

D.G. Mayer, J.A. Belward and K. Burrage

Integrating the analytic hierarchy process andgraph theory to model facilities layout pp. 219-232

Les Foulds and Fariborz Partovi

DEA and benchmarks – an application to Nordic banks pp. 233-250

Göran Bergendahl

An LP-aggregation view on aggregationin multi-level production planning pp. 233-250

Rainer Leisten

Modeling Norwegian petroleum productionand transportation pp. 251-268

Bjørn Nygreen, Marielle Christiansen, Kjetil Haugen, Thor Bjørkvoll and Øystein Kristiansen

Modelling of augmented makespan assignment problems(AMAPs): Computational experience of applyinginteger presolve at the modelling stage pp. 269-288

Paola Baricelli, Gautam Mitra and Bjørn Nygreen

Reformulation of capacitated facility location problems:How redundant information can help pp. 289-308

Karen Aardal

The combined distribution andstochastic assignment problem pp. 309-330

Jan Lundgren and Michael Patriksson

Models for multi-path covering-routing problems pp. 331-342

Brian Boffey and Subhash Narula

Determining cutting stock patternswhen defects are present pp. 343-354

Ronny Aboudi and Paulo Barcia

Creative modeling: Variable and constraint duplicationin primal - dual decomposition methods pp. 355-390

Kaj Holmberg

Modelling path flows for a combined ship routingand inventory management problem pp. 391-413

Marielle Christiansen and Bjørn Nygreen