Free Access Editorial ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26–28 October 2005) p. 433 I. Charon and O. Hudry Published online: 04 April 2009 DOI: https://doi.org/10.1051/ro:2008025 PDF (56.93 KB)
A branch-and-price-and-cut algorithm for the pattern minimization problem p. 435 Cláudio Alves and J.M. Valério de Carvalho Published online: 04 April 2009 DOI: https://doi.org/10.1051/ro:2008027 PDF (262.4 KB)References
Acyclic Orientations with Path Constraints p. 455 Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan and Cid C. de Souza Published online: 04 April 2009 DOI: https://doi.org/10.1051/ro:2008028 PDF (201.2 KB)References
Comparison of algorithms in graph partitioning p. 469 Alain Guénoche Published online: 04 April 2009 DOI: https://doi.org/10.1051/ro:2008029 PDF (896.4 KB)References
Comparing Imperfection Ratio and Imperfection Index for Graph Classes p. 485 Arie M.C.A. Koster and Annegret K. Wagler Published online: 04 April 2009 DOI: https://doi.org/10.1051/ro:2008030 PDF (219.4 KB)References
Three tabu search methods for the MI-FAP applied to 802.11 networks p. 501 Sacha Varone and Nicolas Zufferey Published online: 04 April 2009 DOI: https://doi.org/10.1051/ro:2008026 PDF (208.5 KB)References