Tome 42 (2008) no. 4

Sommaire

ALIO/EURO V conference on combinatorial optimization
p. 433-434
A branch-and-price-and-cut algorithm for the pattern minimization problem
p. 435-453
Acyclic orientations with path constraints
p. 455-467
Comparison of algorithms in graph partitioning
p. 469-484
Comparing imperfection ratio and imperfection index for graph classes
p. 485-500
Three tabu search methods for the MI-FAP applied to 802.11 networks
p. 501-514