Journal: RAIRO Operations Research

Found 507 papers in total
An algorithm for multiparametric min max 0–1-integer programming problems relative to the objective function
An algorithm for multiparametric min max 0–1-integer programming problems relative to the objective function
2005,
The multiparametric min max 0–1-Integer Programming (0–1-IP) problem...
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
2006,
We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of...
A regularization method for ill-posed bilevel optimization problems
A regularization method for ill-posed bilevel optimization problems
2006,
We present a regularization method to approach a solution of the pessimistic...
An interior point algorithm for convex quadratic programming with strict equilibrium constraints
An interior point algorithm for convex quadratic programming with strict equilibrium constraints
2005,
We describe an interior point algorithm for convex quadratic problem with strict...
About the cumulative idle time in multiphase queues
About the cumulative idle time in multiphase queues
2005,
The paper is designated to the analysis of queueing systems, arising in the network...
Combinatorial optimization in DNA mapping – a computational thread of the Simplified Partial Digest Problem
Combinatorial optimization in DNA mapping – a computational thread of the Simplified Partial Digest Problem
2005,
In the paper, the problem of the genome mapping of DNA molecules is presented. In...
Allocating servers to facilities, when demand is elastic to travel and waiting times
Allocating servers to facilities, when demand is elastic to travel and waiting times
2005,
Public inoculation centers are examples of facilities providing service to customers...
A pricing model derived from cooperative games with elastic demand
A pricing model derived from cooperative games with elastic demand
2001,
We propose here a pricing model which is an extension of the cooperative game concept...
Semi-definite positive programming relaxations for graph k-coloring in frequency assignment
Semi-definite positive programming relaxations for graph k-coloring in frequency assignment
2001,
In this paper we will describe a new class of coloring problems, arising from military...
The triangles method to build X-trees from incomplete distance matrices
The triangles method to build X-trees from incomplete distance matrices
2001,
A method to infer X-trees (valued trees having X as a set of leaves) from incomplete...
Differential approximation of NP-hard problems with equal size feasible solutions
Differential approximation of NP-hard problems with equal size feasible solutions
2002,
In this paper, we focus on some specific optimization problems from graph theory,...
Extension of reverse elimination method through a dynamic management of the tabu list
Extension of reverse elimination method through a dynamic management of the tabu list
2001,
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list....
Multiple routing strategies in a labelled network
Multiple routing strategies in a labelled network
2001,
We present here models and algorithms for the construction of efficient path systems,...
Complexity of partial inverse assignment problem and partial inverse cut problem
Complexity of partial inverse assignment problem and partial inverse cut problem
2001,
For a given partial solution, the partial inverse problem is to modify the...
A state-of-the-art report on global optimisation methodology
A state-of-the-art report on global optimisation methodology
2001,
We present a review of the main “global optimization” methods. The paper...
Separable convexification and difference of convex functions techniques for capacity and flow assignment problems
Separable convexification and difference of convex functions techniques for capacity and flow assignment problems
2001,
We study a continuous version of the capacity and flow assignment problem where the...
Efficient and local efficient solutions for assignment type problems
Efficient and local efficient solutions for assignment type problems
2001,
In this paper, we analyse the multiobjective problem generated by applying a goal...
Finding the principal points of a random variable
Finding the principal points of a random variable
2001,
The p-principal points of a random variable X with finite second moment are those p...
An algorithm for solving multiple objective integer linear programming problem
An algorithm for solving multiple objective integer linear programming problem
2002,
In the present paper a complete procedure for solving Multiple Objective Integer...
A unified formulation and approach to the analysis of approximation algorithms: the structure of NP optimisation problems
A unified formulation and approach to the analysis of approximation algorithms: the structure of NP optimisation problems
2002,
This paper is the continuation of the paper “Autour de nouvelles notions pour...
On the M/G/1 retrial queue subjected to breakdowns
On the M/G/1 retrial queue subjected to breakdowns
2002,
Retrial queueing systems are characterized by the requirement that customers finding...
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
2001,
This paper is devoted to the following version of the single machine preemptive...
Multicriteria scheduling problems: a survey
Multicriteria scheduling problems: a survey
2001,
This paper presents a state-of-the-art survey on multicriteria scheduling and...
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine
2001,
Assume that n tasks must be processed by one machine in a fixed sequence. The...
Papers per page: