Probabilistic Analysis of the Generalised Assignment Problem
نویسندگان
چکیده
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved exactly with high probability, in a well-defined sense. The results are closely related to earlier work of Lueker, Goldberg and Marchetti-Spaccamela and ourselves.
منابع مشابه
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
A Frequency Assignment Problem (FAP) is the problem that arises when to a given set of transmitters frequencies have to be assigned such that spectrum is used efficiently and the interference between the transmitters is minimal. In this paper we see the frequency assignment problem as a generalised graph colouring problem, where transmitters are presented by vertices and interaction between two...
متن کاملApplying queuing theory for a reliable integrated location –inventory problem under facility disruption risks
This study considers a reliable location – inventory problem for a supply chain system comprising one supplier, multiple distribution centers (DCs), and multiple retailers in which we determine DCs location, inventory replenishment decisions and assignment retailers to DCs, simultaneously. Each DC is managed through a continuous review (S, Q) inventory policy. For tackling real world conditions...
متن کاملAssignment problem and its application in Nigerian institutions: Hungarian method approach
Assignment model is a powerful operations research techniques that can be used to solve assignment or allocation problem. This study applies the assignment model to the course allocation problem in Nigeria tertiary institution in order to maximize lecturers’ effectiveness. A well-structured questionnaire was used to obtain data from lecturers and solved with Hungarian method. The study revealed...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملAn Interval Assignment Problem with Multiple Attributes: A DEA-Based Approach
One of the basic combinatorial optimization problems is the assignment problem that deals with assigning jobs to individuals. In traditional assignment problems, n jobs usually assign to n individuals such that the total cost is minimized or the total profit is maximized. However, in numerous real-life applications, various attributes could be considered in assignment problems while data (obj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990