TOP: An Official Journal of the Spanish Society of Statistics and Operations Research

1986 - 2025

Current editor(s): Juan José Salazar González and Gustavo Bergantiños

From:
Springer
Sociedad de Estadística e Investigación Operativa
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 8, issue 2, 2000

The stochastic generalised assignment problem with Bernoulli demands pp. 165-190

Maria Albareda-Sambola and Elena Fernández

Generating functions for computing power indices efficiently pp. 191-213

J. Bilbao, J. Fernández, A. Losada and J. López

Comparison of α-Condorcet points with median and center locations pp. 215-234

Clara Rodríguez and José Pérez

A generalized additive, categorical model in data envelopment analysis pp. 235-263

Luka Neralić and Richard Wendell

The generalizedp-Centdian on network pp. 265-285

Dionisio Brito and José Moreno Pérez

Local optimality subsets and global optimization a prospective approach pp. 287-309

Alain Quilliot

Rationalizations of choice functions pp. 311-326

Ma Isabel Rodríguez-Galiano

A note for tightening 0–1 models pp. 327-337

Laureano Escudero and Susana Muñoz

Volume 8, issue 1, 2000

Coalitional values for cooperative games withr alternatives pp. 1-30

M. Albizuri and José Zarzuelo

Implementation of the τ-value pp. 31-41

Gustavo Bergantiños and Luciano Méndez-Naya

Simple games on closure spaces pp. 43-55

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

A real delivery problem dealt with Monte Carlo Techniques pp. 57-71

P. Córdoba, L. García-Raffi, A. Mayado and J. Sanchis

Multicommodity long-term hydrogeneration optimization with capacity and energy constraints pp. 73-96

José González and Narcís Nabona

Multiobjective fractional programming with generalized convexity pp. 97-110

R. Osuna-Gómez, A. Rufián-Lizana and P. Ruíz-Canales

Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization pp. 111-134

Rafael Pastor and Albert Corominas

An algorithmic study of the Maximum Flow problem: A comparative statistical analysis pp. 135-162

A. Sedeño-Noda, M. González-Sierra and C. González-Martín

Corrections to “Queueing analysis of a sequential recognizer of patterns” pp. 163-164

A. Aissani and J. Asselin de Beauville

Volume 7, issue 2, 1999

Preface pp. i-iii

Jesús Artalejo

Switching stochastic models and applications in retrial queues pp. 169-186

Vladimir Anisimov

A classified bibliography of research on retrial queues: Progress in 1990–1999 pp. 187-211

J. Artalejo

AnM/M/c queue with impatient customers pp. 213-220

Nam Boots and Henk Tijms

Asymptotical properties of erlang queueing systems with a dependent Poisson input flow pp. 221-229

Alexander Chechelnitski

MAP 1, MAP 2 /M/c retrial queue with guard channels and its application to cellular networks pp. 231-248

Bong Choi, Yong Chang and Bara Kim

Matrix analytic methods for a multi-server retrial queue with buffer pp. 249-266

Jeffrey Diamond and Attahiru Alfa

BMAP|SM⥻1 model with Markov modulated retrials pp. 267-278

A. Dudin and V. Klimenok

Heavy traffic analysis of M/G/1 type queueing systems with Markov-modulated arrivals pp. 279-291

Gennadi Falin and Anatoli Falin

Reliability of ak-out-of-n system with repair and retrial of failed units pp. 293-304

A. Krishnamoorthy and P. Ushakumari

Markovian polling systems with mixed service disciplines and retrial customers pp. 305-322

Christos Langaris

On queuing systems with failures and several types of input flows pp. 323-332

Eugene Lebedev and Oleg Ponomarchuk

The infinite server queue and heuristic approximations to the multi-server queue with and without retrials pp. 333-350

M. Ramalhoto

Retrial queues pp. 351-353

J. Templeton

Volume 7, issue 1, 1999

Analytical solution for a class of learning by doing models with multiplicative uncertainty pp. 1-23

Francisco Álvarez and Emilio Cerdá

Note on an improved branch-and-bound algorithm to solve n/m/P/F max problems pp. 25-31

Ramón Companys

Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems pp. 33-70

Ricardo Ródenas, M. López and Doroteo Verastegui

An algorithm for computing the stable coalition structures in tree-graph communication games pp. 71-80

Fritz Grafe, Elena Inarra and Ana Mauleon

A generalized Malmquist productivity index pp. 81-101

Emili Grifell-Tatje and C. Lovell

Locally Farkas-Minkowski linear inequality systems pp. 103-121

Rubén Puente and Virginia Vera de Serio

The stochastic bottleneck linear programming problem pp. 123-143

I. Stancu-Minasian, Ricardo Caballero, Emilio Cerdá and M. Muñoz

On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint pp. 145-153

Laureano Escudero, Araceli Garín and Gloria Pérez

On surrogating 0–1 knapsack constraints pp. 155-161

Laureano Escudero, M. Martínez and M. Ortuño

On the consistency of the Banzhaf semivalue pp. 163-168

Luis Ruiz

Volume 6, issue 2, 1998

Preface pp. v-v

Blas Pelegrín

Location of rectilinear center trajectories pp. 159-177

J. Díaz-Báñez and J. Mesa

Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints pp. 179-194

Emilio Carrizosa and Frank Plastria

A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem pp. 195-204

Justo Puerto and R. Fernández

Efficient solution methods for covering tree problems pp. 205-221

T. Boffey

Location of paths on trees with minimal eccentricity and superior section pp. 223-246

Pascual Fernández, Blas Pelegrín and José Fernández

Discretization results for the Huff and Pareto-Huff competitive location models on networks pp. 247-260

Peter Peeters and Frank Plastria

The many-to-many location-routing problem pp. 261-275

G. Nagy and S. Salhi

Solving the plant location problem on a line by linear programming pp. 277-286

Jack Brimberg and Charles ReVelle

A methodology for modelling travel distances by Bias estimation pp. 287-311

Francisco Ortega and Juan Mesa

Maximin location: Discretization not always works pp. 313-319

Isabel Alonso, Emilio Carrizosa and Eduardo Conde

Volume 6, issue 1, 1998

A multi-local optimization algorithm pp. 1-18

Teresa León, Susana Sanmatías and Enriqueta Vercher

0–1 equivalent model representations for air traffic management pp. 19-36

Antonio Alonso and Laureano Escudero

Queuing analysis of a sequential recognizer of patterns pp. 45-66

A. Aissani and J. Beauville

Detecting embedded pure network structures in LP problems pp. 67-95

Nalân Gülpinar, Gautam Mitra and Istvan Maros

Sensitivity analysis in A class of dynamic optimization models pp. 97-121

Jesús Antón, Emilio Cerdá and Elena Huergo

Searching for a strong double tracing in a graph pp. 123-138

Enrique López and David Fernández

Some new results on least square values for TU games pp. 139-158

Luis Ruiz, Federico Valenciano and José Zarzuelo