External Links

    Journal: RAIRO - Operations Research

    Volume 42, Issue 4

    433 -- 434Irène Charon, Olivier Hudry. ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005)
    435 -- 453Cláudio Alves, José M. Valério de Carvalho. A branch-and-price-and-cut algorithm for the pattern minimization problem
    455 -- 467Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan, Cid C. de Souza. Acyclic Orientations with Path Constraints
    469 -- 484Alain Guénoche. Comparison of algorithms in graph partitioning
    485 -- 500Arie M. C. A. Koster, Annegret Katrin Wagler. Comparing Imperfection Ratio and Imperfection Index for Graph Classes
    501 -- 514Sacha Varone, Nicolas Zufferey. Three tabu search methods for the MI-FAP applied to 802.11 networks

    Volume 42, Issue 3

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

    Volume 42, Issue 2

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

    Volume 42, Issue 1

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