1. Tree-sparse convex programs

   • Marc C. Steinbach

   Pages: 347 - 376

2. Some properties of the core on convex geometries

   • Yoshio Okamoto

   Pages: 377 - 386

3. Approximation algorithms for the traveling salesman problem

   • Jérôme Monnot
   • Vangelis Th. Paschos
   • Sophie Toulouse

   Pages: 387 - 405

4. A polynomial algorithm for P | p_j=1, r_j, outtree | ∑ C_j

   • Peter Brucker
   • Johann Hurink
   • Sigrid Knust

   Pages: 407 - 412

5. Unbiased approximation in multicriteria optimization

   • Kathrin Klamroth
   • Jørgen Tind
   • Margaret M. Wiecek

   Pages: 413 - 437

6. Monotonic allocation schemes in clan games

   • Mark Voorneveld
   • Stef Tijs
   • Sofia Grahn

   Pages: 439 - 449

7. The optimality equation and ε-optimal strategies in Markov games with average reward criterion

   • Heinz-Uwe Küenle
   • Ronald Schurath

   Pages: 451 - 471

8. Solution to the risk-sensitive average optimality equation in communicating Markov decision chains with finite state space: An alternative approach

   • Rolando Cavazos-Cadena
   • Daniel Hernández-Hernández

   Pages: 473 - 479

9. Optimality of randomized strategies in a Markovian replacement model

   • Peter Bruns

   Pages: 481 - 499

10. New light on the portfolio allocation problem

    • R. A. Maller
    • D. A. Turkington

    Pages: 501 - 511

11. Project scheduling with inventory constraints

    • Klaus Neumann
    • Christoph Schwindt

    Pages: 513 - 533

12. Book Reviews

    • M. Teresa Melo

    Pages: 535 - 536

13. Book Reviews

    • Justo Puerto

    Pages: 537 - 538

14. Book Reviews

    • Bettina Klinz

    Pages: 539 - 540