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 106, month 9, 2001

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods pp. 19-46

Michel Minoux

An Augmented Arborescence Formulation for the Two-Level Network Design Problem pp. 47-61

Luis Gouveia and João Telhada

On Cost Allocation in Hub-Like Networks pp. 63-78

Darko Skorin-Kapov

Topological Design of Survivable Mesh-Based Transport Networks pp. 79-125

Wayne Grover and John Doucette

Telecommunication Link Restoration Planning with Multiple Facility Types pp. 127-154

Anantaram Balakrishnan, Thomas Magnanti, Joel Sokol and Yi Wang

Constraint Generation for Network Reliability Problems pp. 155-180

Jack Shaio

Hop Constrained Network Design Problem with Partial Survivability pp. 181-198

Samit Soni

Node Placement and Sizing for Copper Broadband Access Networks pp. 199-228

Tamra Carpenter, Martin Eiger, David Shallcross and Paul Seymour

A Tabu Search Algorithm for Access Network Design pp. 229-262

André Girard, Brunilde Sansò and Linda Dadjo

A Comparison of Optimal Methods for Local Access Uncapacitated Network Design pp. 263-286

C.D. Randazzo and H.P.L. Luna

Cellular Network Design Site Selection and Frequency Planning pp. 287-306

Amitava Dutta and Vernon Hsu

Optimizing the Design of a CDMA Cellular System Configuration with Multiple Criteria pp. 307-329

Emanuel Melachrinoudis and Bakhtiar Rosyidi

Optimal Network Design for Wireless Local Area Network pp. 331-345

Geraldo Mateus, Antonio Loureiro and Ricardo Rodrigues

Volume 105, month 7, 2001

The Origins of Geometric Programming pp. 15-19

Elmor Peterson

Design of Civil Engineering Frame Structures Using a Monomial/Newton Hybrid Method pp. 21-35

Scott Burns and Keith Mueller

VLSI Circuit Performance Optimization by Geometric Programming pp. 37-60

Chris Chu and D.F. Wong

Estimating the Firm Value Distribution Function by Entropy Optimization and Geometric Programming pp. 61-75

J.R. Rajasekera and M. Yamada

Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback–Leibler Distance Minimization pp. 77-98

Charles Byrne and Yair Censor

Nonlinear and Geometric Programming – Current Status pp. 99-107

Leon Lasdon

The Fundamental Relations between Geometric Programming Duality, Parametric Programming Duality, and Ordinary Lagrangian Duality pp. 109-153

Elmor Peterson

Proving Strong Duality for Geometric Optimization Using a Conic Formulation pp. 155-184

François Glineur

Quality Tolerancing and Conjugate Duality pp. 185-200

T.R. Jefferson and C.H. Scott

A Cutting Plane Algorithm for Linear Reverse Convex Programs pp. 201-212

Khosrow Moshirvaziri and Mahyar Amouzegar

Convexification, Concavification and Monotonization in Global Optimization pp. 213-226

D. Li, X.L. Sun, M.P. Biswal and F. Gao

Volume 104, month 4, 2001

Preface pp. 13-14

Collette Coullard, Robert Fourer and Jonathan Owen

The Recursive Definition of Stochastic Linear Programming Problems within an Algebraic Modeling Language pp. 15-32

C.S. Buchanan, K.I.M. McKinnon and G.K. Skondras

Analyzing Mathematical Programs Using MProbe pp. 33-48

John Chinneck

Language Constructs for Modeling Stochastic Linear Programs pp. 49-66

Robert Entriken

Efficient Management of Multiple Sets to Extract Complex Structures from Mathematical Programs pp. 67-87

Emmanuel Fragnière, Jacek Gondzio and Robert Sarkissian

A Comprehensive Input Format for Stochastic Linear Programs pp. 89-125

H.I. Gassmann and E. Schweitzer

OMNI Model Management System pp. 127-140

C.A. Haverly

A Declarative Modeling Framework that Integrates Solution Methods pp. 141-161

J.N. Hooker, Hak-Jin Kim and G. Ottosson

Evolving System Architectures for Multimedia Network Design pp. 163-180

E.A. Medova and J.E. Scott

Simulation Model Development and Analysis in UNITY pp. 181-212

Ernest Page and Marc Abrams

Globally Optimized Spherical Point Arrangements: Model Variants and Illustrative Results pp. 213-230

János Pintér

A Representational Paradigm for Dynamic Resource Transformation Problems pp. 231-279

Warren Powell, Joel Shapiro and Hugo Simao

The NOP-2 Modeling Language for Nonlinear Programming pp. 281-312

H. Schichl, S. Dallwig and A. Neumaier

A Tightly Integrated Modelling and Optimisation Library: A New Framework for Rapid Algorithm Development pp. 313-333

James Tebboth and Robert Daniel

The Theory of SML Schema-Directed Query pp. 335-362

Yao-Chuan Tsai

Volume 103, month 3, 2001

FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver pp. 17-32

Qun Chen, Michael Ferris and Jeff Linderoth

An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization pp. 33-47

Y.H. Dai and Yun Yuan

On the Solution of Linear Programs by Jacobian Smoothing Methods pp. 49-70

Stephan Engelke and Christian Kanzow

Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP pp. 71-97

Dong-Hui Li and Masao Fukushima

High-Resolution Color Image Reconstruction with Neumann Boundary Conditions pp. 99-113

Michael Ng and Wilson Kwan

A Predictor–Corrector Algorithm for QSDP Combining Dikin-Type and Newton Centering Steps pp. 115-133

Jia-Wang Nie and Ya-Xiang Yuan

A Combined Algorithm for Fractional Programming pp. 135-147

Jianming Shi

High Order Long-Step Methods for Solving Linear Complementarity Problems pp. 149-159

Josef Stoer

Global Convergence of Conjugate Gradient Methods without Line Search pp. 161-173

Jie Sun and Jiapu Zhang

A Conic Trust-Region Method for Nonlinearly Constrained Optimization pp. 175-191

Wenyu Sun and Ya-xiang Yuan

Solving General Capacity Problem by Relaxed Cutting Plane Approach pp. 193-211

Soon-Yi Wu, Shu-Cherng Fang and Chih-Jen Lin

A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization pp. 213-234

Chengxian Xu and Jianzhong Zhang

Nonlinear Lagrangian Functions and Applications to Semi-Infinite Programs pp. 235-250

X.Q. Yang and K.L. Teo

On a Profit Maximizing Location Model pp. 251-260

Shuzhong Zhang

Modified Block SSOR Preconditioners for Symmetric Positive Definite Linear Systems pp. 263-282

Zhong-Zhi Bai

Parallel Computation of Invariant Measures pp. 283-290

J. Ding and Zhiguo Wang

Symmetric and Non-Symmetric ABS Methods for Solving Diophantine Systems of Equations pp. 291-314

Szabina Fodor

An Extension of the Roots Separation Theorem pp. 315-327

Erxiong Jiang

An Adaptive CGNR Algorithm for Solving Large Linear Systems pp. 329-338

Chunguang Li

On the Square Root of an H-matrix with Positive Diagonal Elements pp. 339-350

Lu Lin and Zhong-Yun Liu

The Successive Over Relaxation Method (SOR) and Markov Chains pp. 351-358

Wilhelm Niethammer

Comparisons of Block Iterative Methods pp. 359-369

Yongzhong Song

Challenging Problems on the Perturbation of Drazin Inverse pp. 371-378

Yimin Wei and Hebing Wu

Invariant Subspace Approach to Linear H∞-Control via Measurement Feedback pp. 379-388

Wen-Wei Lin, Quan-Fu Xu and Fang-Bo Yeh