| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title: Assignment problems in logistics ID Povh, Janez (Author) Logistics_&_Sustainable_Transport_2008_Povh_Assignment_problems_in_logistics.pdf (204,96 KB)MD5: 7F99DE8AAEE25AF0C3709012502AAE4CPID: 20.500.12556/dkum/56930406-f7e0-42aa-93e0-5e8768f67460  http://jlst.fl.uni-mb.si/index.php/journal/article/view/12/11 English Scientific work (r2) 1.01 - Original Scientific Article FL - Faculty of Logistic 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. quadratic assignment problem, linear assignment problem, branch and bound algorithm, heuristics 2008 Published Publisher's version of article 10 str. Letn. 1, št. 3 20.500.12556/DKUM-30962 1854-3332 519.863:656.072 1854-3332 512036925 URN:SI:UM:DK:JFI9E9FA 05.06.2012 1520 111 Misc. Kopiraj citat

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title: Logistics & Sustainable Transport Fakulteta za logistiko Univerze v Mariboru, De Gruyter Open 1854-3332 222476800

Licences

License: CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes. 05.06.2012

Secondary language

Language: Slovenian problem kvadratičnega programiranja, problem linearnega programiranja, metoda razveji in omeji, hevristika

Collection

This document is a part of these collections:
1. Logistics & sustainable transport