Journal: European Journal of Operational Research

Found 7937 papers in total
On the generalizability of advertising pulsation monopoly results to an oligopoly
On the generalizability of advertising pulsation monopoly results to an oligopoly
1999,
This paper introduces, for the first time, an analytical framework for modeling and...
Cost allocation in the Chinese postman problem
Cost allocation in the Chinese postman problem
1999,
This paper considers a cost allocation problem that arises from a delivery problem...
Design of partially survivable networks for cellular telecommunication systems
Design of partially survivable networks for cellular telecommunication systems
1999,
In cellular networks, cells are connected to the mobile telephone switching office...
Algorithms for a multi-level network optimization problem
Algorithms for a multi-level network optimization problem
1999,
In this paper we work on a multi-level network optimization problem that integrates...
Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism
Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism
1999,
Focusing on the generation mechanism of random permutation solutions, this paper...
The dynamic multilevel assignment problem as a stochastic extremal process
The dynamic multilevel assignment problem as a stochastic extremal process
1999,
This paper considers the multilevel assignment problem (i.e. the assignment problem...
The γ-connected assignment problem
The γ-connected assignment problem
1999,
Given a graph and costs of assigning to each vertex one of k different colors, we want...
Optimal stopping problem with recall cost
Optimal stopping problem with recall cost
1999,
This paper presents an optimal stopping problem with recall where some cost must be...
A global optimization method for nonconvex separable programming problems
A global optimization method for nonconvex separable programming problems
1999,
Conventional methods of solving nonconvex separable programming (NSP) problems by...
Maximizing a concave function over the efficient or weakly-efficient set
Maximizing a concave function over the efficient or weakly-efficient set
1999,
An important approach in multiple criteria linear programming is the optimization of...
A dynamic approach to multiple-objective resource allocation problem
A dynamic approach to multiple-objective resource allocation problem
1999,
A new approach using dynamic programming is developed for solving the...
Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
1999,
We propose an interactive approach for multiple objective integer linear programming...
Decentralized method for computing Pareto solutions in multiparty negotiations
Decentralized method for computing Pareto solutions in multiparty negotiations
1999,
This paper presents a decentralized method for computing Pareto-optimal solutions in...
On the convergence of multiobjective evolutionary algorithms
On the convergence of multiobjective evolutionary algorithms
1999,
We consider the usage of evolutionary algorithms for multiobjective programming, i.e....
Solving fuzzy solid transportation problems by an evolutionary algorithm based parametric approach
Solving fuzzy solid transportation problems by an evolutionary algorithm based parametric approach
1999,
The Solid Transportation Problem (STP) arises when bounds are given on three item...
Probabilistic local search algorithms for concave cost transportation network problems
Probabilistic local search algorithms for concave cost transportation network problems
1999,
In practice concave cost transportation problems are characterized as NP-hard,...
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
1999,
One of the major strengths of Constraint Programming is the flexibility and...
Determination of optimal path under approach and exit constraints
Determination of optimal path under approach and exit constraints
1999,
To economize machining process used in component manufacturing a number of procedures...
Routing heuristics for automated pick and place machines
Routing heuristics for automated pick and place machines
1999,
We examine the problem of sequencing the placements of multiple part types for a...
A genetic algorithm solution for one-dimensional bundled stock cutting
A genetic algorithm solution for one-dimensional bundled stock cutting
1999,
This paper discusses a one-dimensional cutting stock problem in which lumber is cut in...
Inventory control under speculation: Myopic heuristics and exact procedures
Inventory control under speculation: Myopic heuristics and exact procedures
1999,
We consider a periodic review inventory problem in which the purchasing cost exhibits...
Efficiency based production planning and control models
Efficiency based production planning and control models
1999,
An attempt has been made, in this paper, to present two efficiency based production...
Simulated annealing for discrete optimization with estimation
Simulated annealing for discrete optimization with estimation
1999,
We extend the basic convergence results for the Simulated Annealing (SA) algorithm to...
Investment and capacity choice under uncertain demand
Investment and capacity choice under uncertain demand
1999,
This paper extends the real options literature by discussing an investment problem,...
Papers per page: