Home
 
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • All
  • Author
  • Title
  • References
  • Full text
NOT
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Mots-clés
  • Full text
  • Previous
  • RAIRO - Operations Research - Recherche Opérationnelle
  • Volume 45 (2011)
  • no. 2
  • Next

Table of contents


Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
Meira, Luis A. A.;  Miyazawa, Flávio K.
p. 75-100

Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Candia-Véjar, Alfredo;  Álvarez-Miranda, Eduardo;  Maculan, Nelson
p. 101-129

A discrete-time Geo [X] /G/1 retrial queue with general retrial time and M-additional options for service
Senthil Kumar, Muthukrishnan
p. 131-152

A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components
You, Peng-Sheng;  Hsieh, Yi-Chih;  Chen, Hisn-Hung
p. 153-178
  • About
  • Help
  • Legal notice
  • Contact
 

Published by

 

Supported by

 
 

Partner of