VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
Celotno besedilo
  • Assignment problems in logistics
    Povh, Janez, 1973-
    We consider two classical problems from location theory which may serve as theoretical models for several logistic problems where one wants to assign elements of a set A to elements of a set B such ... that some linear or quadratic function attains its minimum. It turns out that linear objective function yields a linear assignment problem, which can be solved easily by several primal-dual methods like Hungarian method, Shortest augmenting path method etc. On the other hand, taking quadratic objective function into account makes the problem much harder. The resulting quadratic assignment problem is a very useful model but also very tough problem from theoretical and practical point of view. We list several well-known applications of these models and also the most effective methods to solve the problem. However, it is still a challenging task to solve this problem to optimality when the size of underlying sets A and B is greater than 25 and currently impossible task when the size is greater than 35.
    Vir: Logistics & sustainable transport. - ISSN 1854-3332 (Vol. 1, iss. 3, 2008, f. 15-24)
    Vrsta gradiva - članek, sestavni del
    Leto - 2008
    Jezik - angleški
    COBISS.SI-ID - 264152576