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

   • Francisco Álvarez
   • Emilio Cerdá

   OriginalPaper Pages: 1 - 23

2. Note on an improved branch-and-bound algorithm to solve n/m/P/F_max problems

   • Ramón Companys

   OriginalPaper Pages: 25 - 31

3. Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems

   • Ricardo G. Ródenas
   • M. Luz López
   • Doroteo Verastegui

   OriginalPaper Pages: 33 - 70

4. An algorithm for computing the stable coalition structures in tree-graph communication games

   • Fritz H. Grafe
   • Elena Inarra
   • Ana Mauleon

   OriginalPaper Pages: 71 - 80

5. A generalized Malmquist productivity index

   • E. Grifell-Tatjé
   • C. A. K. Lovell

   OriginalPaper Pages: 81 - 101

6. Locally Farkas-Minkowski linear inequality systems

   • Rubén Puente
   • Virginia N. Vera de Serio

   OriginalPaper Pages: 103 - 121

7. The stochastic bottleneck linear programming problem

   • I. M. Stancu-Minasian
   • R. Caballero
   • M. M. Muñoz

   OriginalPaper Pages: 123 - 143

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

   • Laureano F. Escudero
   • Araceli Garín
   • Gloria Pérez

   Short Communication Pages: 145 - 153

9. On surrogating 0–1 knapsack constraints

   • Laureano Escudero
   • M. Carmen Martínez
   • M. Teresa Ortuño

   Short Communication Pages: 155 - 161

10. On the consistency of the Banzhaf semivalue

    • Luis M. Ruiz

    Short Communication Pages: 163 - 168