✦ LIBER ✦

A general lower bound for the makespan problem

✍ Scribed by S.T. Webster

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 598 KB
Volume: 89
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00333-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for the Shortest Path Prob

A Lower Bound for the Shortest Path Problem

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A tight lower bound for the train revers

A tight lower bound for the train reversal problem

✍ Alok Aggarwal; Tom Leighton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 319 KB

A new lower bound for the quadratic assi

A new lower bound for the quadratic assignment problem

✍ S.I. Sergeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 549 KB

Lower bounds for arithmetic problems

✍ João Meidânis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 543 KB

An optimal lower bound for the Frobenius

An optimal lower bound for the Frobenius problem

✍ Iskander M. Aliev; Peter M. Gruber 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 127 KB

Given N 2 positive integers a 1 , a 2 , . . . , a N with GCD(a 1 , . . . , a N ) = 1, let f N denote the largest natural number which is not a positive integer combination of a 1 , . . . , a N . This paper gives an optimal lower bound for f N in terms of the absolute inhomogeneous minimum of the sta

A new lower bound for the job-shop sched

A new lower bound for the job-shop scheduling problem

✍ Peter Brucker; Bernd Jurisch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 611 KB