Journal: RAIRO - Operations Research

Volume 41, Issue 4

345 -- 360Alain Quilliot, Fatiha Bendali, Jean Mailfert. Cooperative networks games with elastic demands
361 -- 366Alain Hertz, Sacha Varone. A note on tree realizations of matrices
367 -- 380Paulo J. S. Silva, Carlos Humes Jr.. Rescaled proximal methods for linearly constrained convex problems
381 -- 398Thierry Benoist. Towards optimal formwork pairing on construction sites
399 -- 410Brahim Ouhbi, Ali Boudi, Mohamed Tkiouat. The expected cumulative operational time for finite semi-Markov systems and estimation
411 -- 426Georgios Petrou, Claude Lemaréchal, Adam Ouorou. An approach to robust network design in telecommunications
427 -- 454Hadda Cherroun, Alain Darte, Paul Feautrier. vs. integer linear programming techniques
455 -- 464Scott E. Grasman, Zaki Sari, Tewfik Sari. Newsvendor solutions with general random yield distributions
465 -- 478Patrick Maillé. Market clearing price and equilibria of the progressive second price mechanism

Volume 41, Issue 3

231 -- 233Jean François Maurras, Ali Ridha Mahjoub. Editorial
235 -- 251Renaud Sirdey, Hervé Kerivin. A branch-and-cut algorithm for a resource-constrained scheduling problem
253 -- 273Meriema Belaidouni, Walid Ben-Ameur. On the minimum cost multiple-source unsplittable flow problem
275 -- 287Dion Gijswijt, Vincent Jost, Maurice Queyranne. Clique partitioning of interval graphs with submodular costs on the cliques
289 -- 294Arnaud Pêcher, Annegret Wagler. A note on the Chvátal-rank of clique family inequalities
295 -- 304Denis Cornaz. On co-bicliques
305 -- 315Viet Hung Nguyen. Approximation algorithms for metric tree cover and generalized tour and tree covers
317 -- 344Julie Christophe, Jean-Paul Doignon. m-Subspaces of a Finite Affine Space

Volume 41, Issue 2

123 -- 0Jean-Charles Billaut, Emmanuel Néron. Éditorial
125 -- 139Bernard Roy. Double pondération pour calculer une moyenne : Pourquoi et comment ?
141 -- 154Francis Sourd. Scheduling with periodic availability constraints and irregular cost functions
155 -- 170Odile Bellenguez-Morineau, Emmanuel Néron. A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
171 -- 192Nabil Absi, Safia Kedad-Sidhoum. MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
193 -- 211Michel Gourgand, Nathalie Grangeon, Sylvie Norre. Metaheuristics based on Bin Packing for the line balancing problem
213 -- 229Alexandre Dolgui, Nikolai Guschinsky, Genrikh Levin. Optimization of power transmission systems using a multi-level decomposition approach

Volume 41, Issue 1

1 -- 18Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann. Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
19 -- 34Michael C. Ferris, Andrew J. Wathen, Paul Armand. Limited memory solution of bound constrained convex quadratic problems arising in video games
35 -- 47Peng-Sheng You. Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand
49 -- 59Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi. A numerical feasible interior point method for linear semidefinite programs
61 -- 81Amir Azaron, Masatoshi Sakawa, Reza Tavakkoli-Moghaddam, Nima Safaei. A discrete-time approximation technique for the time-cost trade-off in PERT networks
83 -- 93Laurent Alfandari. Improved approximation of the general soft-capacitated facility location problem
95 -- 103Wenceslas Fernandez de la Vega, Marek Karpinski. 1.0957-Approximation Algorithm for Random MAX-3SAT
105 -- 121Zhen-Jun Shi, Xiang-Sun Zhang, Jie Shen. Convergence analysis of adaptive trust region methods