RAIRO - Operations Research, Volume 41
Volume 41, Number 1, January 2007
Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann: Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity. 1-18- Michael C. Ferris, Andrew J. Wathen, Paul Armand: Limited memory solution of bound constrained convex quadratic problems arising in video games. 19-34
- Peng-Sheng You: Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand. 35-47
- Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi: A numerical feasible interior point method for linear semidefinite programs. 49-59
- Amir Azaron, Masatoshi Sakawa, Reza Tavakkoli-Moghaddam, Nima Safaei: A discrete-time approximation technique for the time-cost trade-off in PERT networks. 61-81
- Laurent Alfandari: Improved approximation of the general soft-capacitated facility location problem. 83-93
- Wenceslas Fernandez de la Vega, Marek Karpinski: 1.0957-Approximation Algorithm for Random MAX-3SAT. 95-103
- Zhen-Jun Shi, Xiang-Sun Zhang, Jie Shen: Convergence analysis of adaptive trust region methods. 105-121
Volume 41, Number 2, April 2007
- Bernard Roy: Double pondération pour calculer une moyenne : Pourquoi et comment ? 125-139
- Francis Sourd: Scheduling with periodic availability constraints and irregular cost functions. 141-154
- Odile Bellenguez-Morineau, Emmanuel Néron: A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem. 155-170
- Nabil Absi, Safia Kedad-Sidhoum: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. 171-192
- Michel Gourgand, Nathalie Grangeon, Sylvie Norre: Metaheuristics based on Bin Packing for the line balancing problem. 193-211
- Alexandre Dolgui, Nikolai Guschinsky, Genrikh Levin: Optimization of power transmission systems using a multi-level decomposition approach. 213-229
Volume 41, Number 3, July 2007
- Renaud Sirdey, Hervé Kerivin: A branch-and-cut algorithm for a resource-constrained scheduling problem. 235-251
- Meriema Belaidouni, Walid Ben-Ameur: On the minimum cost multiple-source unsplittable flow problem. 253-273
- Dion Gijswijt, Vincent Jost, Maurice Queyranne: Clique partitioning of interval graphs with submodular costs on the cliques. 275-287
- Denis Cornaz: On co-bicliques. 295-304
- Viet Hung Nguyen: Approximation algorithms for metric tree cover and generalized tour and tree covers. 305-315
Volume 41, Number 4, October 2007
- Alain Quilliot, Fatiha Bendali, Jean Mailfert: Cooperative networks games with elastic demands. 345-360
- Paulo J. S. Silva, Carlos Humes Jr.: Rescaled proximal methods for linearly constrained convex problems. 367-380
- Thierry Benoist: Towards optimal formwork pairing on construction sites. 381-398
- Brahim Ouhbi, Ali Boudi, Mohamed Tkiouat: The expected cumulative operational time for finite semi-Markov systems and estimation. 399-410
- Georgios Petrou, Claude Lemaréchal, Adam Ouorou: An approach to robust network design in telecommunications. 411-426
- Hadda Cherroun, Alain Darte, Paul Feautrier: Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques. 427-454
- Scott E. Grasman, Zaki Sari, Tewfik Sari: Newsvendor solutions with general random yield distributions. 455-464
- Patrick Maillé: Market clearing price and equilibria of the progressive second price mechanism. 465-478
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team