Journal: RAIRO Operations Research

Found 507 papers in total
A new formulation for scheduling unrelated processor under precedence constraints
A new formulation for scheduling unrelated processor under precedence constraints
1999,
We give a new formulation for the problem of task scheduling into unrelated processors...
Hybrid flowshop problems: A survey
Hybrid flowshop problems: A survey
1999,
A special class of scheduling problems is studied in this paper, named Hybrid...
Temporal decomposition approach and characterisation of feasible solutions for the single machine scheduling problem
Temporal decomposition approach and characterisation of feasible solutions for the single machine scheduling problem
1999,
We propose a temporal decomposition approach for the one-machine scheduling problem...
On the application of insertion techniques for job shop problems with setup times
On the application of insertion techniques for job shop problems with setup times
1999,
Constructive heuristics for shop scheduling problems are often based on priority (or...
Approximation algorithms for integer covering problems via greedy column generation
Approximation algorithms for integer covering problems via greedy column generation
1994,
Many combinatorial problems can be formulated as covering problems. In some cases,...
Solution behaviour for parameter-dependent quasi-variational inequalities
Solution behaviour for parameter-dependent quasi-variational inequalities
1996,
In this paper the solution behaviour of a class of parameter-dependent...
The design and application of IPMLO: A FORTRAN library for linear optimization with interior point methods
The design and application of IPMLO: A FORTRAN library for linear optimization with interior point methods
1994,
The design principles of the IPMLO, a modularly structured library of FORTRAN...
Probabilistic bounds on one step objective/potential function improvement in Karmarkar’s algorithm
Probabilistic bounds on one step objective/potential function improvement in Karmarkar’s algorithm
1994,
A detailed probabilistic analysis of the current step of Karmarkar’s algorithm...
Decision-aid problematics: Towards an enlargement of the trilogy ‘choice-sorting-ranking’
Decision-aid problematics: Towards an enlargement of the trilogy ‘choice-sorting-ranking’
1996,
In this article the paper establishes a classification and it discusses the different...
Domination property and existence of Pareto efficient points in convex vector-valued optimization
Domination property and existence of Pareto efficient points in convex vector-valued optimization
1994,
Concepts such as convexity, semi-continuity and recession cones are extended in a...
Technical note on duality in linear vector maximization
Technical note on duality in linear vector maximization
1994,
A dual to the linear vector maximization problem is proposed. This new version...
Duality in convex vector optimization
Duality in convex vector optimization
1994,
The paper considers a fairly general minimization problem in convex vector...
A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
1994,
Group technology techniques are not widely used in many manufacturing systems. Several...
Fritz John’s type conditions and associated duality forms in convex non differentiable vector-optimization
Fritz John’s type conditions and associated duality forms in convex non differentiable vector-optimization
1994,
Necessary and sufficient conditions of the Fritz John’s type as well as...
Comparison of applications of multicriteria UTA methods
Comparison of applications of multicriteria UTA methods
1996,
Among the many multicriteria methods by total aggregation the UTA method proposed by...
Mixed penalties: A two-step superlinear algorithm
Mixed penalties: A two-step superlinear algorithm
1993,
In this paper, the authors present an extrapolation strategy to obtain good starting...
Solutions of transferable utility cooperative games
Solutions of transferable utility cooperative games
1994,
A uniform competitive solution predicts a configuration of payoff vectors associated...
Stability of nash equilibria in locational games
Stability of nash equilibria in locational games
1995,
Consider a locational game on a network in which two competing facilities charge...
A game theoretical anslysis of the quantity discount problem with perfect and incomplete information about the buyer’s cost structure
A game theoretical anslysis of the quantity discount problem with perfect and incomplete information about the buyer’s cost structure
1995,
In this paper, the authors analyze the quantity discount problem by considering the...
Methods for solving stochastic bilinear fractional max-min problems
Methods for solving stochastic bilinear fractional max-min problems
1996,
In this paper the authors consider a stochastic bilinear fractional max-min problem...
An algorithm for indefinite quadratic programming based on a partial Cholesky factorization
An algorithm for indefinite quadratic programming based on a partial Cholesky factorization
1993,
A new algorithm is described for quadratic programming that is based on a partial...
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
1995,
The authors study from a theoretical and numerical point of view an interior point...
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
1996,
The global minimization of an indefinite quadratic function over a bounded polyhedral...
A non improving simplex algorithm for transportation problems
A non improving simplex algorithm for transportation problems
1996,
A simplex type algorithm for the Transportation Problem (TP) is presented. TPs with...
Papers per page: