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.

Towards a constructive approach to act-conditional subjective expected utility models pp. 167-186: Zhigang Xie and Simon French
The biobjective absolute center problem pp. 187-199: Rosa Ramos, Joaquín Sicilia and Teresa Ramos
Different ways to represent weighted majority games pp. 201-211: J. Freixas
A comparison of algorithm RS with algorithm OPTSOL70 pp. 213-219: Marc Almiñana and Jesus Pastor
Modelling and solving the production rate variation problem (PRVP) pp. 221-239: Joaquín Bautista, Ramon Companys and Albert Corominas
The Hierarchical compromise programming pp. 253-281: María Escobar and José Moreno-Jiménez
A tabu search algorithm for the Open Shop problem pp. 283-296: David Alcaide, Joaquín Sicilia and Daniele Vigo
Probabilistic order level system with lead time when delay in payments are permissible pp. 297-305: Nita Shah
A necessary and sufficient condition to a pareto optimal without optimizing the weighting criterion pp. 307-311: M. Sánchez and M. Sobrón

A survey of some mathematical programming models in transportation pp. 1-40: Jaume Barceló
Solving large set covering problems for crew scheduling pp. 41-59: Ferdinando Pezzella and Enrico Faggioli
A few practical problems on the application of OD-estimation in motorway networks pp. 61-80: Yong Zhou and Thomas Sachse
Traffic queue estimation pp. 81-93: Jean-Louis Gallego, Jean-Loup Farges and Jean-Jacques Henry
Assessing the efficiency of rapid transit configurations pp. 95-104: Gilbert Laporte, Juan Mesa and Francisco Ortega
The two-convex-polygons TSP: A solvable case pp. 105-126: Alfredo García and F. Tejel
Linearity criterion for the selection of an optimal tree pp. 127-142: Arantza Rio, Francisco Cano Sevilla and Antonio Prados
On the optimal control of stochastic linear systems with contaminated partial observations pp. 143-157: Rosario Romera
On due-date based valid cuts for the sequential ordering problem pp. 159-166: L. Escudero and M. Ortuño

Asymptotic behavior of continuous stochastic games pp. 187-214: M. Muruaga and R. Vélez
Some properties of cliques in 0–1 mixed integer programs pp. 215-223: L. Escudero, A. Garín and G. Pérez
A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale networks pp. 225-256: L. Montero and J. Barceló
A prekernel characterization by means of stability properties pp. 257-267: Emilio Calvo Ramón and E. Gutiérrez
An improvement and an extension of the Elzinga & Hearn's algorithm to the 1-center problem in ℝ n withl 2b -normswithl 2b -norms pp. 269-284: B. Pelegrín and L. Cánovas
Utility efficiency and its approximation pp. 285-299: A. Mateos and S. Ríos-Insua
Optimal purchase and advertising for a product with immediate sale start pp. 301-318: Daniela Favaretto and Bruno Viscolani
Variability reduction with multiweighing proceedings pp. 319-329: M. Salicrú, C. González and J. Barreiro
Optimal use of hub facilities: A two-hub model with fixed arc costs pp. 331-343: R. Garfinkel, P. Sundararaghavan, C. Noon and D. Smith
Approximate algorithms for theP‖C max problem pp. 345-359: J. Riera, D. Alcaide and J. Sicilia
A model for strategic planning under uncertainty pp. 361-384: P. Baricelli, C. Lucas, E. Messina and G. Mitra

Combinatorial optimization and small polytopes pp. 1-53: T. Christof and G. Reinelt
Discussion pp. 54-64: Laureano Escudero, M. Ortuño, V. Campos, Reinhardt Euler and Michael Jünger
The Vehicle Routing-Allocation Problem: A unifying framework pp. 65-86: John Beasley and E. Nascimento
On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0–1 mixed integer programs pp. 87-98: L. Escudero, A. Garín and G. Pérez
A G/M/1-queue with exponential retrial pp. 99-120: R. Lillo
A retrial model in a nonstationary regime pp. 121-133: M. Vázquez
A branch-and-cut algorithm for a generalization of the Uncapacitated Facility Location Problem pp. 135-163: A. Caprara and J. González
On the reduced game property for and the axiomatization of the T -value of TU-games pp. 165-185: Theo Driessen

Multiobjective routing problems pp. 167-220: B. Boffey, Francisco García, Gilbert Laporte, Juan Mesa and Blas Pelegrín
A new algorithm for the Integer Knapsack Problem and its parallelization pp. 221-234: F. Almeida, F. García, D. Morales, J. Roda and C. Rodríguez
A simple procedure to compute the nucleolus of Γ-component additive games pp. 235-245: F. Grafe, Ana Mauleon and Elena Inarra
Paréto equilibria in multicriteria metagames pp. 247-263: S. Wang and Z. Li
On ranking of feasible solutions of a bottleneck linear programming problem pp. 265-283: K. Mathur, M. Puri and S. Bansal
On the M/G/1 retrial queueing system with linear control policy pp. 285-305: M. Martín and A. Gómez-Corral
A review of O.R. practice in Spain pp. 307-336: M. López and Jesus Pastor

Robust stabilization of internally delayed uncertain systems via sliding mode control pp. 1-34: N. Luo and M. Sen
On the axiomatization of the τ-value pp. 35-46: Emilio Calvo Ramón, S. Tijs, Federico Valenciano and José Zarzuelo
Fuzzy multicriteria decision support for budget allocation in the transport sector pp. 47-68: J. Montero, A. Pearman and J. Tejada
On solving stochastic production planning problems via scenario modelling pp. 69-95: L. Escudero and P. Kamesam
Reciprocal cooperation in the Prisoner's Dilemma repeated with random horizon pp. 97-116: C. Manuel and J. Tejada
Cooperation indices and coalitional value pp. 117-135: Redhwan Amer and F. Carreras
Hores: A timetabling system for Spanish secondary schools pp. 137-144: R. Alvarez-Valdes, G. Martin and J. Tamarit
Demurrage costs optimization in ports using binary mathematical programming models pp. 145-159: E. Parra
A correction of the justification of the Dietrich-escudero-garín-pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates pp. 161-165: S. Muñoz