Journal: RAIRO - Operations Research

Volume 39, Issue 4

227 -- 241Jacek Blazewicz, Marta Kasprzak. Combinatorial optimization in DNA mapping - a computational thread of the Simplified Partial Digest Problem
243 -- 252José Luis Quintero, Alejandro Crema. An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
253 -- 273Giovanni P. Crespi, Ivan Ginchev, Matteo Rocca. A note on Minty type vector variational inequalities
275 -- 293Mustapha Aouchiche, Pierre Hansen. Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille

Volume 39, Issue 3

143 -- 162Vladimir Marianov, Miguel Rios, Francisco Javier Barros. Allocating servers to facilities, when demand is elastic to travel and waiting times
163 -- 183Luke Finlay, Prabhu Manyem. Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
185 -- 224Alain Quilliot, Fatiha Bendali, Jean Mailfert. Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité

Volume 39, Issue 2

75 -- 85Saulius Minkevicius, Stasys Steisunas. About the cumulative idle time in multiphase queues
87 -- 103Hervé Deleau, Jin-Kao Hao, Frédéric Saubion. Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
105 -- 122Huy Trandac, Philippe Baptiste, Vu Duong. Airspace sectorization with constraints
123 -- 139Jean-Charles Régin, Michel Rueher. Inequality-sum: a global constraint capturing the objective function

Volume 39, Issue 1

3 -- 12Hidefumi Kawakatsu, Hiroaki Sandoh. A mathematical model for an optimal appointed delivery date on a home delivery market
13 -- 33Rachid Benouahboun, Abdelatif Mansouri. An interior point algorithm for convex quadratic programming with strict equilibrium constraints
35 -- 54Pawoumodom L. Takouda. Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?
55 -- 74Cédric Pralet, Gérard Verfaillie. About the choice of the variable to unassign in a decision repair algorithm