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

TL;DR: In this paper, the authors consider a family of discrete, deterministic, single-criterion, NP-hard problems, including set packing, set covering, and set partitioning.

TL;DR: In this article, the authors studied the problem of finding a vertex such that the sum of the weights of the verticles in V (Y r ) is maximized, where V ( Y r ) = { νeV | d ( ν, Y r) d( ν, X p )}, d (ν, Z ) = min { d (λ, z )| zeZ }, and d(λ, z ) is the length of a shortest path in G from v to z.

TL;DR: The article describes various modes of operating cargo ships and proposes a classification scheme for ship routing and scheduling models and problems, and breaks the models down into transportation system models, liner operations, tramp shipping, industrial operations and other models.

TL;DR: Several formulations and heuristic algorithms for solving the vehicle routing problem when the demands at individual delivery (pickup) locations behave as random variables are presented.

TL;DR: This paper is an attempt to put model validation and related issues in a framework that may be of use both to model-builders and to decision-makers.

TL;DR: This paper defines a minimal repair in the term of the failure rate and devices some probability quantities and reliability properties and the replacement model where a system is replaced at time T or at n th failure are considered.

TL;DR: Fuzzy Set Theory as proposed by L. Zadeh in 1965 promises to bridge part of the gap in modelling of problems which are not well-structured and which can not easily be cast into classical mathematical models.

TL;DR: A selective review of the locational analysis literature is given, concentrating on models which have been thoroughly tested, and which can be solved by ‘reliable algorithms’.

TL;DR: In this article, a lower bound for the capacitated warehouse location problem based upon the Lagrangean relaxation of a mixed-integer formulation of the problem is presented, where they use subgradient optimisation in an attempt to maximise this lower bound.

TL;DR: Computational tests with quadratic assignment problems (QAP) showed that it finds very good suboptimal solutions in moderate time and behaves computationally stable.

TL;DR: The results seem to indicate that an alternate location-allocation-savings procedure and a saving-drop procedure are promising, and a newspaper delivery system consisting of 4500 customers is solved.

TL;DR: The paper generalizes heuristics for the uncapacitated plant location model to the capacitated case using ADD, DROP, SHIFT, ALA, AlA, and VSM based on elementary ADD and DROP operations.

TL;DR: In this paper, it was shown that the 3-dimensional assignment problem is NP-complete, and that the problem of finding perfect matchings of two bipartite graphs G 1, G 2 with the same sets of vertices is also NP-hard.

TL;DR: A method is developed which still finds the best k-interchange that can be produced from an initial feasible DARP tour in O(Nk) time, the same order of magnitude as in the Lin heuristic for the TSP.

TL;DR: In this paper, a large multi-criteria model is carried out in order to provide the framework for comparison of six energy chains: oil, coal, nuclear, solar thermal Themis, Solar thermal Thek and solar photovoltaic specified in the French conditions.

TL;DR: In this paper, exact algorithms for a series of simultaneous location and routing problems are developed, which are formulated as integer programs which are solved by a constraint relaxation procedure, and numerical results are reported.

TL;DR: Two alternative approaches for determining planning values for manufacturing lead times to use in production planning and control systems are reviewed and it is concluded that the second is the most appropriate but that it requires a close cooperation between the production and marketing functions of the firm.

TL;DR: This work investigates the arrival rate of customers in equilibrium, where each customer is fully aware of the characteristics of the system, and develops a set of equations from which the equilibrium queue size distribution and expected waiting time can be numerically computed as functions of time.

TL;DR: It is shown that for any two neighborhood subtrees containing the same endpoint of a longest path in the tree one is contained in the other and this result is used to obtain O(n2) algorithms for the minimum cost covering problem and theminimum cost operating problem.

TL;DR: In this article, a branch and bound algorithm for the problem is presented which incorporates lower bounds that are obtained using a new technique called the multiplier adjustment method, and the lower bound is obtained by performing a Lagrangean relaxation of the deadline constraints; the Lagrange multipliers are chosen so that the sequence generated by the heuristic is an optimal solution of the relaxed problem.

TL;DR: A survey of the state-of-the-art in differential game applications to management science and operations research problems can be found in this paper, where a number of differential games applications are reviewed.

TL;DR: In combination with an upper bound this analysis enables the elimination of variables in the symmetric traveling salesman problem and the implementation is described in a traveling salesman algorithm based on the 1-tree relaxation.

TL;DR: In this paper, the authors exploit the theory of fuzzy sets to demonstrate how acceptance control charts can be constructed to explicitly account for the degree of conformance exhibited by each unit or sample of product.

TL;DR: In this article, the authors describe the development of risk analysis models for a variety of clients and problems over the past eight years, in terms of relationships between perceived problems and the structure of the models used, using contentions or statements of prejudice prior to and after each study.

TL;DR: In this paper, a set reduction algorithm was developed for problems in k-dimensional space having rectangular distances. But this algorithm is not suitable for continuous location problems with l p distances.