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 81, month 6, 1998

Preface pp. 0-0

G. Mitra, I. Maros and A. Sciomachen

A nonconvex weighted potential function forpolynomial target following methods pp. 3-14

E. de Klerk, C. Roos and T. Terlaky

A nonlinear path-following method for computingthe equilibrium curve of structures pp. 15-24

A. Csébfalvi

ASYNPLEX, an asynchronous parallelrevised simplex algorithm pp. 27-50

J. Hall and K. McKinnon

Calculating the exact bounds of optimal valuesin LP with interval coefficients pp. 51-62

Frantisÿek Mráz

An algorithm for solving bicriterial linear programmingproblems with parametrical coefficients in theobjective functions pp. 63-72

Stefan Chanas and Dorota Kuchta

A block active set algorithm for large-scalequadratic programming with box constraints pp. 75-96

L. Fernandes, A. Fischer, J. Júdice, C. Requejo and J. Soares

A path following method for LCP withsuperlinearly convergent iteration sequence pp. 97-114

Florian Potra and Rongqin Sheng

A Newton-like approach to solvingan equilibrium problem pp. 115-128

Vladimir Bulavsky and Vyacheslav Kalashnikov

Dynamic stochastic programmingfor asset-liability management pp. 131-162

G. Consigli and M. Dempster

Parallelization and aggregation ofnested Benders decomposition pp. 163-188

M. Dempster and R. Thompson

Stochastic optimization with structured distributions:The case of Bayesian nets pp. 189-212

A. Gaivoronski and F. Stella

Chance-constrained stochastic programming forintegrated services network management pp. 213-230

E. Medova

Reformulation of the set partitioning problem as apure network with special order set constraints pp. 233-250

Agha Iqbal Ali

Implementation of a steepest-edge primal - dualsimplex method for network linear programs pp. 251-270

Norman Curet

Solving the multi-airport Ground Holding Problem pp. 271-288

Lorenzo Brunetta, Guglielmo Guastalla and Lisa Navazio

A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem pp. 289-306

M. Dell'Amico, F. Maffioli and A. Sciomachen

A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph pp. 307-320

Carlos Luz and Domingos Cardoso

An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness pp. 321-343

Yakov Zinder and Duncan Roper

On the set covering polytope:Facets with coefficients in {0, 1, 2, 3} pp. 343-356

M. Sánchez-García, M. Sobrón and B. Vitoriano

A method for solving ship routing problemswith inventory constraints pp. 357-378

Marielle Christiansen and Bjorn Nygreen

On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems pp. 379-404

L. Escudero, S. Martello and P. Toth

Integer programming approaches tofacilities layout models with forbidden areas pp. 405-418

L. Foulds, H. Hamacher and J. Wilson

Towards a closer integration of finite domainpropagation and simplex-based algorithms pp. 421-433

Mozafar Hajian, Hani El-Sakkout, Mark Wallace, Jonathan Lever and Barry Richards

Assignment and sequencing models for thescheduling of process systems pp. 433-466

Jose Pinto and Ignacio Grossmann

Modelling discrete optimisation problems inconstraint logic programming pp. 467-496

Peter Barth and Alexander Bockmayr

Solving a mixed-integer multiobjective bond portfoliomodel involving logical conditions pp. 497-514

R. Pinto and B. Rustem

Volume 80, month 1, 1998

Introduction to topics on preference modelling pp. 0-0

Denis Bouyssou and Philippe Vincke

Numerical representation of choice functions pp. 1-10

Josep E. Peris, M. Carmen Sánchez and Begoña Subiza

Generalized utility based on values of opportunity sets pp. 11-26

Andrey V. Malishevski

Extended partial orders:A unifying structure for abstract choice theory pp. 27-48

Klaus Nehring and Clemens Puppe

Choice procedures and rational selections pp. 49-66

Taradas Bandyopadhyay

Dynamically consistent choice and the revelationof Strotz-Pollak equilibrium pp. 67-84

Stephen A. Clark

Autobiased choice theory pp. 85-103

Antoine Billot

Characterizable fuzzy preference structures pp. 105-136

Bartel Van de Walle, Bernard De Baets and Etienne Kerre

Multicriteria filtering methods based onconcordance and non-discordance principles pp. 137-165

Patrice Perny

Preference conditions for utility models:A risk-value perspective pp. 167-182

James S. Dyer and Jianmin Jia

Subjective expected lexicographic utility:Axioms and assessment pp. 183-206

Peter C. Fishburn and Irving H. LaValle

Imprecise sampling and direct decision making pp. 207-235

Christophe Gonzales and Jean-Yves Jaffray

The risk-structure dependence effect:Experimenting with an eye to decision-aiding pp. 237-252

Mohammed Abdellaoui and B. Munier

Should we use simultaneous equations to modeldecision-making? A methodological note pp. 253-262

Paul Anand

A note on the existence of continuous representationsof homothetic preferences on a topological vector space pp. 263-268

Gianni Bosi

Existence of additive utility on positive semigroups:An elementary proof pp. 269-279

Juan Candeal, Esteban Induráin and Esteban Olóriz

Lamarckian genetic algorithmsapplied to the aggregation of preferences pp. 281-297

Irène Charon and Olivier Hudry

Characterizations of scoring methodsfor preference aggregation pp. 299-332

Pavel Yu. Chebotarev and Elena Shamis

Objectivity and subjectivity in thedecision making process pp. 333-345

John T. Buchanan, Erez J. Henig and Mordecai I. Henig

Volume 79, month 1, 1998

Preface: Queueing Networks with Blocking pp. 0-0

Demetres Kouvatsos and Yves Dallery

Large deviations of the sojourn time for queues in series pp. 3-26

A.J. Ganesh

Spectral expansion solution for some finite capacity queues pp. 27-44

Ram Chakka

Bursty traffic and finite capacity queues pp. 45-62

Fergal Toomey

A finite capacity multi-server multi-queueing priority model with non-renewal input pp. 63-82

Dietmar Wagner

MVA for product-form cyclic queueing networks with blocking pp. 83-96

M. Claudia Clò

A convolution algorithm for product-form queueing networks with blocking pp. 97-117

S. Balsamo and M.C. Clò

Analysis of queueing networks with blocking using a new aggregation technique pp. 121-142

Johann Christoph Strelen, Berthold Bärk, Jürgen Becker and Volker Jonas

Arbitrary open queueing networks with server vacation periods and blocking pp. 143-180

Charalabos Skianis and Demetres Kouvatsos

Performance evaluation of open queueing networks with arbitrary configuration and finite buffers pp. 181-206

H.S. Lee, A. Bouhchouch, Y. Dallery and Y. Frein

Throughput estimation in cyclic queueing networks with blocking pp. 207-229

T. Tolio and S.B. Gershwin

MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes pp. 231-269

Demetres Kouvatsos and Irfan-Ullah Awan

Approximate analysis of networks of PH|PH|1|K queues with customer losses: Test results pp. 271-291

Boudewijn Haverkort

Bounds and error bounds for queueing networks pp. 295-319

Nico van Dijk

Blocking policies in pharmaceutical transfer lines pp. 323-347

Esra Dogan-Sahiner and Tayfur Altiok

A two-layer queueing model to predict performance of packet transfer in broadband networks pp. 349-371

Hiroshi Inai and Jiro Yamakita

An aggregation technique to evaluate the performance of a two-stage buffered ATM switch pp. 373-392

M. Moulki, A.L. Beylot, L. Truffet and M. Becker

Exact and asymptotic solutions for models of new telecommunication services pp. 393-407

Gagan Choudhury, Yaakov Kogan and Silvio Susskind