Top (journal of operations research)

• 

  Año 1999, Vol. 7, Número 1

  • Analytical for a Class of Learning by Doing Models with Multiplicative Uncertainty

    Emilio Cerdá Tena, Francisco Álvarez González

    págs. 1-23

    

  • Note on an improved branch-and-bound algorithm to solve n/m/P/Fmax problems

    Ramón Companys Pascual

    págs. 25-31

    

  • Extensions of Dinkelbach's Algorithm for Solving Non-Linear Fractional Programming Games

    Ricardo García Ródenas, María Luz López Rodríguez, Doroteo Verástegui Rayo

    págs. 33-70

    

  • An Algorithm for Computing the Stable Coalition Structures in Tree-Graph Communication Games

    Fritz Hans Grafe Arias, Ana C. Mauleón Echeverria, Elena Iñarra García

    págs. 71-80

    

  • A Generalized Malmquist Productivity Index

    Emili Grifell i Tatjé, C. A. Knox Lovell

    págs. 81-101

    

  • Locally Farkas-Minkowski Linear Inequality Systems

    Rubén Puente, Virginia N. Vera de Serio

    págs. 103-121

    

  • The stochastic bottleneck linear programming problem

    María del Mar Muñoz Martos, J.M. Stancu-Minasian, Emilio Cerdá Tena, Rafael Caballero Fernández

    págs. 123-143

    

  • On Using an Automatic Scheme for Obtaining the Convex Hull Defining Inequalities of a Weismantel 0-1 Knapsack Constraint

    Gloria Pérez, Laureano Fernando Escudero Bueno, María Araceli Garín Martín

    págs. 145-153

    

  • On surrogating 0-1 knapsack constraint

    Carmen Martínez Blázquez, Laureano Fernando Escudero Bueno, María Teresa Ortuño Sánchez

    págs. 155-161

    

  • On the Consistency of the Banzhaf Semivalue

    Luis M. Ruiz

    págs. 163-168