Semidefinite Programming Based Algorithms for the Sparsest Cut Problem p. 75

Luis A.A. Meira and Flávio K. Miyazawa

Published online: 17 June 2011

DOI: https://doi.org/10.1051/ro/2011104

• PDF (673.4 KB)
• References

Minmax regret combinatorial optimization problems: an Algorithmic Perspective p. 101

Alfredo Candia-Véjar, Eduardo Álvarez-Miranda and Nelson Maculan

Published online: 24 August 2011

DOI: https://doi.org/10.1051/ro/2011111

• PDF (330.3 KB)
• References

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

Muthukrishnan Senthil Kumar

Published online: 22 September 2011

DOI: https://doi.org/10.1051/ro/2011109

• PDF (631.6 KB)
• References

A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components p. 153

Peng-Sheng You, Yi-Chih Hsieh and Hisn-Hung Chen

Published online: 22 September 2011

DOI: https://doi.org/10.1051/ro/2011105

• PDF (316.0 KB)
• References