✦ LIBER ✦

Generating lower bounds for the linear arrangement problem

✍ Scribed by Weiguo Liu; Anthony Vannelli

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 806 KB
Volume: 59
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0168-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating lower bounds for the prize co

Generating lower bounds for the prize collecting Steiner problem in graphs

✍ Abilio Lucena; Mauricio Resende 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 262 KB

A general lower bound for the makespan p

A general lower bound for the makespan problem

✍ S.T. Webster 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Lower bounds based on linear programming

Lower bounds based on linear programming for the quadratic assignment problem

✍ Zvi Drezner 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 268 KB

An algorithm for the linear complementar

An algorithm for the linear complementarity problem with upper and lower bounds

✍ G. Laan; A. J. J. Talman 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 776 KB

Lower bounds for linear interval routing

✍ Eilam, T.; Moran, S.; Zaks, S. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB 👁 2 views

Linear interval routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant of interval routing where the routing range associated with every link is represented by an interval with no wraparound. A common way to measure the efficiency of such ro

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