838,984 research outputs found

    The Quadratic Assignment Problem : Some New Result and Generalization

    Full text link
    The Quadratic assignment problem is a combinatorial problem ofdeciding the placement of facilities in specified locations in such a wayas to minimize an function expressed in terms of distances betweenlocations and flows between facilities. The approach presented in thispaper is to treat is as a large quadratic programming problem withinteger resfictions on the variables. The integer requirements areinitially relaxed, and the nearest feasible solutions in then sought.schemes for accomplishing this are described, and their applicability tomore general problems is discussed

    The scholarship assignment problem

    Get PDF
    There are n graduate students and n faculty members. Each student will be assigned a scholarship by the joint faculty. The socially optimal outcome is that the best student should get the most prestigious scholarship, the second-best student should get the second most prestigious scholarship, and so on. The socially optimal outcome is common knowledge among all faculty members. Each professor wants one particular student to get the most prestigious scholarship and wants the remaining scholarships to be assigned according to the socially optimal outcome. We consider the problem of finding a mechanism such that in equilibrium, all scholarships are assigned according to the socially optimal outcome.Publicad

    The referee assignment problem

    Get PDF
    In collaboration between a UPC spinoff, Barcelogic, and the Dutch Football Federation (KNVB), we define, study, implement and evaluate different approaches for solving the so-called Referee Assignment Problem(RAP). In this NP-complete constraint solving problem, numerous conditions must be met, such as the balance in the number of matches each referee must officiate, the frequency of each referee being assigned to a given team, the distance each referee must travel over the course of a season, etc

    Size versus fairness in the assignment problem

    Get PDF
    When not all objects are acceptable to all agents, maximizing the number of objects actually assigned is an important design concern. We compute the guaranteed size ratio of the Probabilistic Serial mechanism, i.e., the worst ratio of the actual expected size to the maximal feasible size. It converges decreasingly to 1 − 1 e 63.2% as the maximal size increases. It is the best ratio of any Envy-Free assignment mechanism

    Approximating the multi-level bottleneck assignment problem.

    Get PDF
    We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book 'Assignment Problems' by Burkard et al. (2009) on pages 188-189. One of the applications described there concerns bus driver scheduling.We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph. Keywords: bottleneck problem; multidimensional assignment; approximation; computational complexity; efficient algorithm.Bottleneck problem; Multidimensional assignment; Approximation; Computational complexity; Efficient algorithm;

    Channel assignment in cellular radio

    Get PDF
    Some heuristic channel-assignment algorithms for cellular systems are described. These algorithms have yielded optimal, or near-optimal assignments, in many cases. The channel-assignment problem can be viewed as a generalized graph-coloring problem, and these algorithms have been developed, in part, by suitably adapting some of the ideas previously introduced in heuristic graph-coloring algorithms. The channel-assignment problem is formulated as a minimum-span problem, i.e. a problem wherein the requirement is to find the minimum bandwidth necessary to satisfy a given demand. Examples are presented, and algorithm performance results are discussed

    Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem

    Get PDF
    We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB — a quadratic assignment problem library. Journal on Global Optimization, 10: 291–403, 1997]. AMS classification: 90C22, 20Cxx, 70-08.quadratic assignment problem;semidefinite programming;group sym- metry
    corecore