Volume 42, Number 1, January 2008

• 
  Clarisse Dhaenens, Patrick Siarry, El-Ghazali Talbi: Editorial. 1-2

• 
  Thibaut Lust, Jacques Teghem: MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. 3-33
• 
  Hayfa Zgaya, Slim Hammadi, Khaled Ghédira: Combination of mobile agent and evolutionary algorithm to optimize the client transport services. 35-67
• 
  Mohamed Khabzaoui, Clarisse Dhaenens, El-Ghazali Talbi: Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery. 69-83

Volume 42, Number 2, April 2008

• 
  Abdelhamid Benchakroun, Abdelatif Mansouri: Éditorial. 85

• 
  Abdelmalek Aboussoror, Abdelatif Mansouri: Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems. 87-103
• 
  Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau: Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. 103-121
• 
  Jean-Pierre Crouzeix, Bachir Merikhi: A logarithm barrier method for semi-definite programming. 123-139
• 
  Jean-Pierre Dussault: La différentiation automatique et son utilisation en optimisation. 141-155
• 
  A. El Afia, Abdelhamid Benchakroun, Jean-Pierre Dussault, K. El Yassini: Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications. 157-198
• 
  Mohamed El Ghami, Cornelius Roos: Generic Primal-dual Interior Point Methods Based on a New Kernel Function. 199-213
• 
  Khaled Moumene, Jacques A. Ferland: New representation to reduce the search space for the resource-constrained project scheduling problem. 215-228
• 
  Monia Rekik, Jean-François Cordeau, François Soumis: Solution approaches to large shift scheduling problems. 229-258

Volume 42, Number 3, July 2008

• 
  Ali Rhida Mahjoub, Pierre Pesneau: On the Steiner 2-edge connected subgraph polytope. 259-283
• 
  Jean François Maurras, Roumen Nedev: On the convex hull of projective planes. 285-289
• 
  Sriraman Sridharan: Polynomial time algorithms for two classes of subgraph problem. 291-298
• 
  J. Frédéric Bonnans, Matthieu André: Fast computation of the leastcore and prenucleolus of cooperative games. 299-314
• 
  Jérôme Monnot: A note on the hardness results for the labeled perfect matching problems in bipartite graphs. 315-324
• 
  Jean Damay, Alain Quilliot, Eric Sanlaville: Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results. 325-359
• 
  Vaithilingam Jeyakumar, Sivakolundu Srisatkunarajah, Nguyen Quang Huy: Unified global optimality conditions for smooth minimization problems with mixed variables. 361-370
• 
  John Sylva, Alejandro Crema: Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming. 371-387
• 
  François Dubeau, Oumar Mandione Guèye: Une nouvelle méthode d'initialisation pour le problème de transport. 389-400
• 
  Adrian Deaconu: The inverse maximum flow problem considering l _∞ norm. 401-414
• 
  Nacima Labadi, Christian Prins, Mohamed Reghioui: A memetic algorithm for the vehicle routing problem with time windows. 415-431

Volume 42, Number 4, October 2008

• 
  Irène Charon, Olivier Hudry: ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005). 433-434

• 
  Cláudio Alves, José M. Valério de Carvalho: A branch-and-price-and-cut algorithm for the pattern minimization problem. 435-453
• 
  Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan, Cid C. de Souza: Acyclic Orientations with Path Constraints. 455-467
• 
  Alain Guénoche: Comparison of algorithms in graph partitioning. 469-484
• 
  Arie M. C. A. Koster, Annegret Katrin Wagler: Comparing Imperfection Ratio and Imperfection Index for Graph Classes. 485-500
• 
  Sacha Varone, Nicolas Zufferey: Three tabu search methods for the MI-FAP applied to 802.11 networks. 501-514

last updated on Fri May 24 06:29:15 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page