✦ LIBER ✦

Improved lower bounds for the cycle detection problem

✍ Scribed by Eric Allender; Maria M. Klawe

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 353 KB
Volume: 36
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90044-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved lower bounds for the Split Deli

Improved lower bounds for the Split Delivery Vehicle Routing Problem

✍ Lorenza Moreno; Marcus Poggi de Aragão; Eduardo Uchoa 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 273 KB

An improved lower bound for the bin pack

An improved lower bound for the bin packing problem

✍ Bintong Chen; Bharatendu Srivastava 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Improved lower bounds for the capacitate

Improved lower bounds for the capacitated lot sizing problem with setup times

✍ Raf Jans; Zeger Degraeve 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 238 KB

The 3x+1 problem: new lower bounds on no

The 3x+1 problem: new lower bounds on nontrivial cycle lengths

✍ Shalom Eliahou 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 607 KB

## Eliahou, S., The 3x+ 1 problem: new lower bounds on nontrivial cycle lengths, Discrete Mathematics 118 (1993) 45556. Let 7': N -+ N be the function defined by T(n) = n/2 if n is even, T(n) = (3n + 1)/2 if n is odd. We show, among other things, that any nontrivial cyclic orbit under iteration o

An improved assignment lower bound for t

An improved assignment lower bound for the euclidean traveling salesman problem

✍ William R Stewart Jr. 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 353 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