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

TL;DR: In this article, the relation between the most productive scale size (mpss) for paparticular input and output mixes and returns to scale for multiple-inputs multiple-outputs situations is explicitly developed.

TL;DR: The quadratic assignment problem (QAP) as discussed by the authors is a generalization of the problem of finding the minimum walking distance of a person from a building to another building for a given set of possible sites.

TL;DR: It is proved that any pair of nondominated path can be connected by nondominated paths, which is the support of an algorithm that can be viewed as a variant of the simplex method used in continuous linear multiobjective programming.

TL;DR: Suboptimal solutions differing 1–2% from the best known solutions are obtained by a simple program in short time by starting this program several times with different starting values all known minimal objective function values were reached.

TL;DR: The results of an effort to define a new ad hoc schedule for this situation, so that the total passenger delay on an airline network is minimized.

TL;DR: A polynomial approximation scheme for an m-constraint 0–1 integer programming problem (m fixed) based on the use of the dual simplex algorithm for linear programming and the asymptotic properties of a particular random model are analyzed.

TL;DR: Empirical results using both a primal heuristic and a hybrid heuristic-subgradient method for problems having n ⩽ 100 show that the algorithms locate close to optimal solutions without resorts to tree enumeration.

TL;DR: In this article, the application of Lagrangean techniques to the capacitated plant location problem when the model considered is a pure integer one was studied. But the results were limited to capacitated problems with additional constraints.

TL;DR: The purpose of this paper is to present practically useful approximations for the recorder point s such that the required service level is achieved and for the first time tractable approximation for the continuous review (s, S) inventory system with undershoots of the reorder point are obtained.

TL;DR: Computational and theoretical aspects of a new heuristic for the multidimensional zero-one knapsack problem are studied and its computational efficiency is compared with two other well-known heuristics.

TL;DR: An attempt is made to encompass in a unified framework some of the most relevant models on the subject to be found in the literature.

TL;DR: In this paper, the problem of locating facilities over all levels in a multi-level distribution system where commodities are shipped from origin-level facilities to destination points via a number of intermediate level facilities is formulated as a mixed integer linear program with the so-called tight or disaggregated constraints.

TL;DR: In this article, a method for analysing one-stage systems including both the stochastic nature of the real world and the interaction between products and capacity must be taken into account.

TL;DR: In this article, an algorithm is presented for determining the K best paths that may contain cycles in a directed network, which can be used not only for the classical K shortest paths problem but also for ranking paths under a nonlinear objective function, provided that an algorithm to determine the best path exists.

TL;DR: In this article, the authors classify the hierarchical location allocation problems into two classes: the p-median problem and the total weighted travel distance minimization problem, where the goal is to locate p facilities among n (⩾ p ) locations such that the total travel distance is minimized.

TL;DR: In this article, a simulation study of hierarchical planning procedures, which can support a material requirements planning system, was conducted in a Swedish manufacturing company, where three final products considered in the simulations represent a major part of this company.

TL;DR: In this paper, a generalization of the Benders partitioning method to the mixed integer case is presented, where a number of alternatives are presented for integrating IP heuristics in Benders, thus alleviating the necessity of solving a sequence of integer master problems.

TL;DR: It is shown that the MBA problem is NP-complete and an asymptotically optimal algorithm is presented, and some computational results are illustrated which prove the efficiency of the algorithm.

TL;DR: In this paper, the problem of locating at minimum total costs both plants and warehouses in a two-level distribution system where commodities are delivered from plants to customers either directly or indirectly via warehouses is addressed.

TL;DR: Four models are considered where the unit is replaced after a specified number of failures, shocks, repairs and preventive maintenances have occurred and extended models with two variables are introduced.

TL;DR: The author argues the case for an algorithmic optic on the problems of applied probability, sketches the main steps in the construction of computer codes for the evaluation of stationary distributions of interest, and builds on certain nonlinear matrix equations that arise naturally in the study of structured Markov chains.

TL;DR: It is found that one must be very careful about applying weights when using these techniques, as different techniques use these scales in ways that change the manner in which they should be defined.

TL;DR: Using recent research on evolutionary systems design and on the process of learning preferences in multicriteria decision making, a Decision Support System (DSS) is proposed for semi-structured buying decisions.

TL;DR: In this paper, a discrete buffered system with infinite buffer size is considered, where the output channels are available only periodically, and the condition for stochastic equilibrium is obtained and the generating function of the buffer occupancy is derived.

TL;DR: The scaling technique introduced by Edmonds and Karp (1972) may be extended to quadratic cost flows and leads to a polynomial algorithm for this class of problems and provides an alternative approach to the polynometric algorithm suggested by Helgason, Kennington and Lall (1980).

TL;DR: The stationary probability vector and several performance characteristics are obtained using the matrix-geometric solution technique to consider a service system with two similar servers in which a customer, on arrival, joins the shorter queue.

TL;DR: A branching and pruning algorithm is proposed to minimize an unconstrained quadratic function of 0–1 variables and a necessary and sufficient condition for such a point is identified.