Journal: RAIRO Operations Research

Found 507 papers in total
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques
2007,
The recourse to operation research solutions has strongly increased the performances...
An approach to robust network design in telecommunications
An approach to robust network design in telecommunications
2007,
In telecommunications network design, one of the most frequent problems is to adjust...
Towards optimal formwork pairing on construction sites
Towards optimal formwork pairing on construction sites
2007,
Minimizing shutterings assembling time on construction sites can yield significant...
Newsvendor solutions with general random yield distributions
Newsvendor solutions with general random yield distributions
2007,
Most systems are characterized by uncertainties that cause throughput to be highly...
Scheduling with periodic availability constraints and irregular cost functions
Scheduling with periodic availability constraints and irregular cost functions
2007,
This paper addresses a one-machine scheduling problem in which the efficiency of the...
A branch-and-bound method for solving multi-skill project scheduling problem
A branch-and-bound method for solving multi-skill project scheduling problem
2007,
This paper deals with a special case of Project Scheduling problem: there is a project...
Metaheuristics based on Bin Packing for the line balancing problem
Metaheuristics based on Bin Packing for the line balancing problem
2007,
The line balancing problem consists in assigning tasks to stations in order to respect...
Optimization of power transmission systems using a multi-level decomposition approach
Optimization of power transmission systems using a multi-level decomposition approach
2007,
We discuss the use of operations research methods for computer-aided design of...
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
2007,
We address a multi-item capacitated lot-sizing problem with setup times that arises in...
Double weighting for calculating an average: Why and how?
Double weighting for calculating an average: Why and how?
2007,
The weighted average operator is often used to assign a value v(a) to entities a from...
Large neighborhood improvements for solving car sequencing problems
Large neighborhood improvements for solving car sequencing problems
2006,
The NP -hard problem of car sequencing has received a lot of attention these last...
Explanations for identifying and exploiting structures within combinatorial problems
Explanations for identifying and exploiting structures within combinatorial problems
2006,
Identifying structure in a given combinatorial problem is often a key step for...
Bounds of graph parameters for global constraints
Bounds of graph parameters for global constraints
2006,
This article presents a basic scheme for deriving systematically a filtering algorithm...
1.0957-approximation algorithm for random MAX-3SAT
1.0957-approximation algorithm for random MAX-3SAT
2007,
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957...
Convergence analysis of adaptive trust region methods
Convergence analysis of adaptive trust region methods
2007,
In this paper, we propose a new class of adaptive trust region methods for...
A numerical feasible interior point method for linear semidefinite programs
A numerical feasible interior point method for linear semidefinite programs
2007,
This paper presents a feasible primal algorithm for linear semidefinite programming....
Limited memory solution of bound constrained convex quadratic problems arising in video games
Limited memory solution of bound constrained convex quadratic problems arising in video games
2007,
We describe the solution of a bound constrained convex quadratic problem with limited...
Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand
Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand
2007,
This paper investigates an inventory control problem where a firm orders and sells an...
Improved approximation of the general soft-capacitated facility location problem
Improved approximation of the general soft-capacitated facility location problem
2007,
The soft-capacitated facility location problem, where each facility is composed of a...
A discrete-time approximation technique for the time–cost trade-off in PERT networks
A discrete-time approximation technique for the time–cost trade-off in PERT networks
2007,
We develop a discrete-time approximation technique dealing with the time–cost...
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
2007,
We study a deterministic problem of evaluating the worst case performance of flexible...
Large neighborhood improvements for solving car sequencing problems
Large neighborhood improvements for solving car sequencing problems
2006,
The NP -hard problem of car sequencing has received a lot of attention these last...
Bounds of graph parameters for global constraints
Bounds of graph parameters for global constraints
2006,
This article presents a basic scheme for deriving systematically a filtering algorithm...
Explanations for identifying and exploiting structures within combinatorial problems
Explanations for identifying and exploiting structures within combinatorial problems
2006,
Identifying structure in a given combinatorial problem is often a key step for...
Papers per page: