Editorial
ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26–28 October 2005)
-
- Published online by Cambridge University Press:
- 04 April 2009, pp. 433-434
-
- Article
-
- You have access
- Export citation
Research Article
On the Steiner 2-edge connected subgraph polytope
-
- Published online by Cambridge University Press:
- 20 August 2008, pp. 259-283
-
- Article
- Export citation
Editorial
Éditorial
-
- Published online by Cambridge University Press:
- 17 May 2008, p. 85
-
- Article
-
- You have access
- Export citation
Editorial
-
- Published online by Cambridge University Press:
- 21 February 2008, pp. 1-2
-
- Article
-
- You have access
- Export citation
Research Article
On the convex hull of projective planes
-
- Published online by Cambridge University Press:
- 20 August 2008, pp. 285-289
-
- Article
- Export citation
Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems
-
- Published online by Cambridge University Press:
- 17 May 2008, pp. 87-103
-
- Article
- Export citation
A branch-and-price-and-cut algorithmfor the pattern minimization problem
-
- Published online by Cambridge University Press:
- 04 April 2009, pp. 435-453
-
- Article
- Export citation
MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
-
- Published online by Cambridge University Press:
- 21 February 2008, pp. 3-33
-
- Article
- Export citation
Polynomial time algorithms for two classes of subgraph problem
-
- Published online by Cambridge University Press:
- 20 August 2008, pp. 291-298
-
- Article
- Export citation
Acyclic Orientations with Path Constraints
-
- Published online by Cambridge University Press:
- 04 April 2009, pp. 455-467
-
- Article
- Export citation
Combination of mobile agentand evolutionary algorithm to optimizethe client transport services
-
- Published online by Cambridge University Press:
- 21 February 2008, pp. 35-67
-
- Article
- Export citation
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
-
- Published online by Cambridge University Press:
- 17 May 2008, pp. 103-121
-
- Article
- Export citation
Combining evolutionary algorithmsand exact approaches for multi-objective knowledge discovery
-
- Published online by Cambridge University Press:
- 21 February 2008, pp. 69-83
-
- Article
- Export citation
Comparison of algorithms in graph partitioning
-
- Published online by Cambridge University Press:
- 04 April 2009, pp. 469-484
-
- Article
- Export citation
A logarithm barrier methodfor semi-definite programming
-
- Published online by Cambridge University Press:
- 17 May 2008, pp. 123-139
-
- Article
- Export citation
Fast computation of the leastcoreand prenucleolus of cooperative games
-
- Published online by Cambridge University Press:
- 20 August 2008, pp. 299-314
-
- Article
- Export citation
A note on the hardness resultsfor the labeledperfect matching problems in bipartite graphs
-
- Published online by Cambridge University Press:
- 20 August 2008, pp. 315-324
-
- Article
- Export citation
Comparing Imperfection Ratio and Imperfection Index for Graph Classes
-
- Published online by Cambridge University Press:
- 04 April 2009, pp. 485-500
-
- Article
- Export citation
La différentiation automatiqueet son utilisation en optimisation
-
- Published online by Cambridge University Press:
- 17 May 2008, pp. 141-155
-
- Article
- Export citation
Three tabu search methods for the MI-FAP applied to 802.11 networks
-
- Published online by Cambridge University Press:
- 04 April 2009, pp. 501-514
-
- Article
- Export citation