| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Izpis gradiva Pomoč

Naslov:Assignment problems in logistics
Avtorji:ID Povh, Janez (Avtor)
Datoteke:.pdf Logistics_&_Sustainable_Transport_2008_Povh_Assignment_problems_in_logistics.pdf (204,96 KB)
MD5: 7F99DE8AAEE25AF0C3709012502AAE4C
PID: 20.500.12556/dkum/56930406-f7e0-42aa-93e0-5e8768f67460
 
URL http://jlst.fl.uni-mb.si/index.php/journal/article/view/12/11
 
Jezik:Angleški jezik
Vrsta gradiva:Znanstveno delo
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:FL - Fakulteta za logistiko
Opis: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.
Ključne besede:quadratic assignment problem, linear assignment problem, branch and bound algorithm, heuristics
Status publikacije:Objavljeno
Verzija publikacije:Objavljena publikacija
Leto izida:2008
Št. strani:10 str.
Številčenje:Letn. 1, št. 3
PID:20.500.12556/DKUM-30962 Novo okno
ISSN:1854-3332
UDK:519.863:656.072
COBISS.SI-ID:512036925 Novo okno
ISSN pri članku:1854-3332
NUK URN:URN:SI:UM:DK:JFI9E9FA
Datum objave v DKUM:05.06.2012
Število ogledov:2350
Število prenosov:157
Metapodatki:XML DC-XML DC-RDF
Področja:Ostalo
:
Kopiraj citat
  
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share



Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Logistics & Sustainable Transport
Založnik:Fakulteta za logistiko Univerze v Mariboru, De Gruyter Open
ISSN:1854-3332
COBISS.SI-ID:222476800 Novo okno

Licence

Licenca:CC BY-NC-ND 4.0, Creative Commons Priznanje avtorstva-Nekomercialno-Brez predelav 4.0 Mednarodna
Povezava:http://creativecommons.org/licenses/by-nc-nd/4.0/deed.sl
Opis:Najbolj omejujoča licenca Creative Commons. Uporabniki lahko prenesejo in delijo delo v nekomercialne namene in ga ne smejo uporabiti za nobene druge namene.
Začetek licenciranja:05.06.2012

Sekundarni jezik

Jezik:Slovenski jezik
Ključne besede:problem kvadratičnega programiranja, problem linearnega programiranja, metoda razveji in omeji, hevristika


Zbirka

To gradivo je del naslednjih zbirk del:
  1. Logistics, supply chain, sustainability and global challenges

Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici