| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
Copositive and semidefinite relaxations of the quadratic assignment problem
Janez Povh, Franz Rendl, 2009, izvirni znanstveni članek

Opis: Semidefinite relaxations of the quadratic assignment problem (QAP) have recently turned out to provide good approximations to the optimal value of QAP. We take a systematic look at various conic relaxations of QAP. We first show that QAP can equivalently be formulated as a linear program over the cone of completely positive matrices. Since it is hard to optimize over this cone, we also look at tractable approximations and compare with several relaxations from the literature. We show that several of the well-studied models are in fact equivalent. It is still a challenging task to solve the strongest of these models to reasonable accuracy on instances of moderate size.
Ključne besede: matematično programiranje, problem kvadratičnega prirejanja, kopozitivno programiranje, semidefinitna poenostavitev, quadratic assignment problem, copositive programming, semidefinite relaxations, lift-and-project relaxations
Objavljeno: 10.07.2015; Ogledov: 707; Prenosov: 76
URL Povezava na celotno besedilo

Assignment problems in logistics
Janez Povh, 2008, izvirni znanstveni članek

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
Objavljeno: 05.06.2012; Ogledov: 1187; Prenosov: 84
.pdf Celotno besedilo (204,96 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.07 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici