Showing papers in "European Journal of Operational Research in 1979"

TL;DR: A model and an algorithm are proposed for the simultaneous optimal selection among a given set of products of the assortment of products to be sold in a supermarket and the allocation of shelf space to these products.

TL;DR: In this paper, the relationship between directions of steepest ascent and shortest subgradients under different normalization constraints is discussed. And various strategies for generating and updating the Lagrangian multiplier vectors in the course of dual optimization are discussed.

TL;DR: Investigation of the influence of each variable on patient's wainting-time and doctor's idle-time showed that a considerable reduction in the number of variables could be achieved.

TL;DR: By using the “savings method” proposed by Clarke and Wright, and extended by Gaskell, each one of the above problems is defined as a series of assignment problems, and it is possible to obtain the optimal solution in a finite number of steps.

TL;DR: The travelling salesman problem is expanded to include the following situations: a subset (or subsets) of cities - called a cluster - must be visited contiguously and precedence relations are imposed on some clusters.

TL;DR: The paper summarizes regression analysis including generalized least squares which might be used for simulation responses with non-constant variances, and the validity of the postulated regression metamodel is tested statistically.

TL;DR: Inexact linear programs are considered in which the form of the resource set is generalized, but for the general convex resource set no finite representation is apparently possible, although the rudiments of an iterative, approximation algorithm are given.

TL;DR: In this paper, a special purpose algorithm called PROPOSAS is proposed to solve the problem of optimal product positioning in an attribute space, which works under simplified assumptions: Euclidean metric, equally weighted dimensions of the attribute space and equal sales per customer.

TL;DR: The procedure presented is a branch-and-bound algorithm which concentrates on the special structure of the problem, equipped with dominance rules, bounding arguments and reliable branching heuristics, indicating the method to be more than competitive to ones previously reported.

TL;DR: “Linear admissible transformations” are studied, with their characterization, and the more relevant transformations given by other authors when solving the Single-Travelling Salesman Problem and the Delivery Problem are discussed.

TL;DR: In this paper, the authors present an application by giving an optimal control method for the regulation of the water level of Lake Balaton in Hungary, where one decision period is one month.

TL;DR: The paper deals with the problem of finding a minimum cost multicommodity flow on an uncapacitated network with concave link costs and proposes a vertex following algorithm to find a local optimum.

TL;DR: A heuristic method for solving the optimal network problem is proposed and shown to yield high quality results and the concept of forced moves is introduced.

TL;DR: In this article, the authors give an economic interpretation of results derived from mathematical replacement models and show that the moment of replacement is always determined by the equality of marginal replacement costs to the marginal costs of postponed replacement.

TL;DR: In this article, the authors report on their experiences of using cognitive mapping as the basis for constructing an "operational game" which was designed and developed to help with policy analysis and evaluation, as a device for team development, and as a unique method of raising funds for the Charity who had requested their involvement.

TL;DR: It is shown that the only linear admissible transformations are those obtained by adding constants to the rows and columns of a scalar multiple of the distance matrix.

TL;DR: In this paper, the authors discuss a particular approach to policy analysis derived from the internal political dimension of policy and policy making, one which involves the construction of models for the policy maker as client that are importantly different in nature from typical rational-scientific models of operational research.

TL;DR: Decision-making in queueing systems where individual customers have one or both of two options: option to join or balk, (2) option to choose priority through a payment made on arrival, are discussed.

TL;DR: In this article, a case study describes how such a nationwide logistics problem was tackled in Bangladesh and a solution procedure based upon the solution of rather large-scale mixed integer programming problems was discussed.

TL;DR: How two mathematical programming methods, linear programming and goal programming, can be applied to determine a civil service salary structure for the New York State Department of Transportation (Region 10) is described.

TL;DR: This paper deals with health status as an intrinsically ambiguous and multi-dimensional expression which is determined through some subjective judgement and introduces the concept of fuzziness and fuzzy set in order to study the ambiguous health status.

TL;DR: In this paper, a method for determining a maximal gain policy in the policy constrained case is described, which involves the use of bounds on the gain of the feasible policies to produce a policy ranking list, which then forms a basis for a bounded enumeration procedure which yields the optimal policy.

TL;DR: The role of management science in the strategic planning process in Gulf Oil Corporation is discussed in this paper, where two levels of planning are covered: planning at the functional Company level and at the Corporate level.