RAIRO - Operations Research

Free Access

Editorial

Foreword – Advanced Optimization Approaches and Modern OR-Applications

Imed Kacem, Hans Kellerer and Pierre Laroche

RAIRO-Oper. Res., 50 4-5 (2016) 677-679

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016066

PDF (58.92 KB)

Improving the solution complexity of the scheduling problem with deadlines: A general technique

Amir Elalouf and Eugene Levner

RAIRO-Oper. Res., 50 4-5 (2016) 681-687

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016021

Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands

Elyn L. Solano-Charris, Christian Prins and Andréa Cynthia Santos

RAIRO-Oper. Res., 50 4-5 (2016) 689-714

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016048

Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices

Junheng Cheng, Feng Chu, Chengbin Chu and Weili Xia

RAIRO-Oper. Res., 50 4-5 (2016) 715-732

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2015063

Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect

Zhanguo Zhu, Feng Chu, Yugang Yu and Linyan Sun

RAIRO-Oper. Res., 50 4-5 (2016) 733-748

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016007

Automated Credit Rating Prediction in a competitive framework

Claude Gangolf, Robert Dochow, Günter Schmidt and Thomas Tamisier

RAIRO-Oper. Res., 50 4-5 (2016) 749-765

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016030

Competitive versus cooperative performances of a Stackelberg game between two suppliers

Ibtissem Ernez-Gahbiche, Khaled Hadjyoussef, Abdelwaheb Dogui and Zied Jemai

RAIRO-Oper. Res., 50 4-5 (2016) 767-780

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016050

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

Benoit Darties, Rodolphe Giroudeau, Jean-Claude König and Gilles Simonin

RAIRO-Oper. Res., 50 4-5 (2016) 781-795

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016034

Two stage decision making approach for Sensor Mission Assignment Problem

K. Rathi and S. Balamohan

RAIRO-Oper. Res., 50 4-5 (2016) 797-807

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016051

Dominance measuring methods for the selection of cleaning services in a European underground transportation company

Antonio Jiménez-Martín, Alfonso Mateos and Juan A. Fernández del Pozo

RAIRO-Oper. Res., 50 4-5 (2016) 809-824

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016038

Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application

Ayet Allah Ferjani, Noureddine Liouane and Pierre Borne

RAIRO-Oper. Res., 50 4-5 (2016) 825-843

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016061

Optimal investment with transaction costs and dividends for an insurer

Junna Bi and Qingbin Meng

RAIRO-Oper. Res., 50 4-5 (2016) 845-855

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016015

An exact method to generate all nondominated spanning trees

Asma Boumesbah and Mohamed El-Amine Chergui

RAIRO-Oper. Res., 50 4-5 (2016) 857-867

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016060

A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem

Seyed Shamsodin Hosseini and Mehdi Seifbarghy

RAIRO-Oper. Res., 50 4-5 (2016) 869-890

Published online: 03 November 2016

DOI: https://doi.org/10.1051/ro/2016057

New concept of connection in bidirected graphs

Ouahiba Bessouf and Abdelkader Khelladi

RAIRO-Oper. Res., Forthcoming article

Received: 03 February 2016 / Revised: 31 May 2017 / Accepted: 10 June 2017

DOI: https://doi.org/10.1051/ro/2017053

PDF (508 KB)

RAIRO - Operations Research

Special issue - Advanced Optimization Approaches and Modern OR-Applications

New concept of connection in bidirected graphs