Journal: European Journal of Operational Research

Found 7937 papers in total
The generalized data envelopment analysis model and the convex cone constrained game
The generalized data envelopment analysis model and the convex cone constrained game
2000,
This study extends the research on relating the data envelopment analysis (DEA) with...
An optimal procurement policy for items with an inventory level-dependent demand rate and fixed lifetime
An optimal procurement policy for items with an inventory level-dependent demand rate and fixed lifetime
2000,
This paper investigates an optimal procurement policy for items with an inventory...
Efficient lot-sizing under a differential transportation cost structure for serially distributed warehouses
Efficient lot-sizing under a differential transportation cost structure for serially distributed warehouses
2000,
A major cost element in the logistics of distributed warehousing is transportation...
Network distance characteristics that affect computational effort in p-median location problems
Network distance characteristics that affect computational effort in p-median location problems
2000,
In solving location models, the effort expended and the quality of the solutions...
The dynamic predicate stashing copy problem and the Steiner problem in graphs
The dynamic predicate stashing copy problem and the Steiner problem in graphs
2000,
The Dynamic Predicate Stashing Copy Problem (DPSCP) is a problem about managing an...
Dimension of valued relations
Dimension of valued relations
2000,
The classical notion of dimension of a partial order can be extended to the valued...
A framework for the description of evolutionary algorithms
A framework for the description of evolutionary algorithms
2000,
Evolutionary algorithms are optimisation techniques inspired from natural evolution...
Reinforcement learning with internal expectation for the random neural network
Reinforcement learning with internal expectation for the random neural network
2000,
The reinforcement learning scheme proposed in Halici for the random neural network is...
Survey of random neural network applications
Survey of random neural network applications
2000,
This paper consists of a survey of various engineering applications based on the...
Training the random neural network using quasi-Newton methods
Training the random neural network using quasi-Newton methods
2000,
Training in the random neural network (RNN) is generally specified as the minimization...
New stopping criterion for genetic algorithms
New stopping criterion for genetic algorithms
2000,
Genetic Algorithms have been successfully applied in a wide variety of problems....
Benders-and-cut algorithm for fixed-charge capacitated network design problem
Benders-and-cut algorithm for fixed-charge capacitated network design problem
2000,
We develop a Benders-and-cut algorithm for fixed-charge capacitated network design...
New modeling approaches for the design of local access transport area networks
New modeling approaches for the design of local access transport area networks
2000,
This paper is concerned with the design of a local access and transport area network...
Digital data networks design using genetic algorithms
Digital data networks design using genetic algorithms
2000,
Communication networks have witnessed significant growth in the last decade due to the...
Reliability optimization of a series system with multiple-choice and budget constraints
Reliability optimization of a series system with multiple-choice and budget constraints
2000,
This paper considers a reliability optimization problem for a series system with...
On weighted centers for semidefinite programming
On weighted centers for semidefinite programming
2000,
In this paper, we generalize the notion of weighted centers to semidefinite...
Approximation of linear programs by Bregman's DF projections
Approximation of linear programs by Bregman's DF projections
2000,
The motivation of this paper is twofold: to contribute to the theory of Bregman's D F...
A note on a modified simplex approach for solving bilevel linear programming problems
A note on a modified simplex approach for solving bilevel linear programming problems
2000,
We analyze the article ‘A modified simplex approach for solving bilevel linear...
A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
2000,
The properties of linear fractional functions facilitate the usage of a well known...
A sampling-based method for generating nondominated solutions in stochastic multi-objective mathematical programming problems
A sampling-based method for generating nondominated solutions in stochastic multi-objective mathematical programming problems
2000,
This paper presents a method for generating nondominated solutions for stochastic...
Multiobjective second order symmetric duality with cone constraints
Multiobjective second order symmetric duality with cone constraints
2000,
We formulate a pair of multiobjective symmetric dual programs for arbitrary cones. Our...
A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
2000,
In this paper, a polynomial activity insertion algorithm in a multi-resource schedule...
The disjunctive graph machine representation of the job shop scheduling problem
The disjunctive graph machine representation of the job shop scheduling problem
2000,
The disjunctive graph is one of the most popular models used for describing instances...
On not-first/not-last conditions in disjunctive scheduling
On not-first/not-last conditions in disjunctive scheduling
2000,
This paper is concerned with the development of constraint propagation techniques for...
Papers per page: