Quadratic assignment problems on seriesparallel digraphs
| Year of publication: |
1986
|
|---|---|
| Authors: | Rendl, F. |
| Published in: |
Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research. - Heidelberg : Physica-Verl., ISSN 0340-9422, ZDB-ID 246737-9. - Vol. 30.1986, 3, p. 161-173
|
| Subject: | Mathematik | Graphentheorie | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Betriebliche Standortwahl | Firm location choice |
-
On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Huckenbeck, Ulrich, (1988)
-
Facilities layout generalized model solved by n-boundary shortest path heuristics
Giffin, J. W., (1987)
-
Approximations for the random minimal spanning tree with application to network provisioning
Jain, Anjani, (1988)
- More ...
-
Ranking scalar products to improve bounds for the quadratic asignment problem
Rendl, F., (1985)
-
Semidefinite relaxations for partitioning, assignment and ordering problems
Rendl, Franz, (2012)
-
Ranking scalar products to improve bounds for the quadratic assignment problem
Rendl, F., (1985)
- More ...