✦ LIBER ✦

Bounds for the frequency assignment problem

✍ Scribed by D.H. Smith; S. Hurley

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 562 KB
Volume: 167-168
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00257-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper and lower bounds for the fixed spe

Upper and lower bounds for the fixed spectrum frequency assignment problem

✍ Roberto Montemanni 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 41 KB

Lower bounding and tabu search procedure

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints

✍ Alain Hertz; David Schindl; Nicolas Zufferey 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 164 KB

Lower bounds for the quadratic semi-assi

Lower bounds for the quadratic semi-assignment problem

✍ Federico Malucelli; Daniele Pretolani 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Bounds for the quadratic assignment prob

Bounds for the quadratic assignment problem using the bundle method

✍ Franz Rendl; Renata Sotirov 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 227 KB

Constructive bounds and exact expectatio

Constructive bounds and exact expectations for the random assignment problem

✍ Don Coppersmith; Gregory B. Sorkin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

The random assignment problem is to choose a minimum-cost perfect matching in a complete n = n bipartite graph, whose edge weights are chosen randomly from some distribution such as the exponential distribution with mean 1. In this case it is known that the expectation does not grow unboundedly with

Lower bounds for the quadratic assignmen

Lower bounds for the quadratic assignment problem via triangle decompositions

✍ Stefan E. Karisch; Franz Rendl 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 686 KB