Skip Navigation Linksdomov > napredno iskanje > rezultati > izpis
Zapis SUTRS

VRSTA GRADIVAanalitična raven (sestavni del), tekstovno gradivo, tiskano, 1.01 - izvirni znanstveni članek
DRŽAVA IZIDASlovenija
LETO IZIDA2008
JEZIK BESEDILA/IZVIRNIKAangleški
PISAVAlatinica
DELO IMAilustracije
AVTORPovh, Janez - avtor
NASLOVAssignment problems in logistics
V PUBLIKACIJILogistics & sustainable transport. - ISSN 1854-3332.. - ǂVol. ǂ1, ǂiss. ǂ3 (2008), f. 15-24.
KRATKA VSEBINAWe 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 setB such that some linear or quadratic function attains its minimum. It turnsout 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 effectivemethods 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.
OPOMBEBibliografija: f. 23-24 // Abstract
ELEKTRONLOKACIJA/DOSTOPDostopno tudi na: http://www.jlst.org/uploads/paper_submitted_povh.pdf
PREDMETNE OZNAKE// logistika // organizacija // problemi // reševanje problemov // optimiranje
UDK005.51:519.863
COBISSSI-ID26

izvedba, lastnina in pravice: NUK 2010