✦ LIBER ✦

Solving linear bottleneck assignment problems via strong spanning trees

✍ Scribed by Ronald D Armstrong; Zhiying Jin

Book ID: 107918243
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 136 KB
Volume: 12
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(92)90103-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An augmenting path method for solving Li

An augmenting path method for solving Linear Bottleneck Assignment problems

✍ U. Derigs; U. Zimmermann 📂 Article 📅 1978 🏛 Springer Vienna 🌐 English ⚖ 459 KB

A turnpike approach to solving the linea

A turnpike approach to solving the linear bottleneck assignment problem

✍ Ching-Chung Kuo,Gillian Nicholls 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 299 KB

Solving Frequency Assignment Problems vi

Solving Frequency Assignment Problems via Tree-Decomposition1

✍ Arie M.C.A. Koster; Stan P.M. van Hoesel; Antoon W.J. Kolen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 69 KB

In this extended abstract we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. Wi