✦ LIBER ✦

A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms

✍ Scribed by I. Ben-Aroya; D. D. Chinn; A. Schuster

Publisher: Springer
Year: 1998
Tongue: English
Weight: 306 KB
Volume: 21
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009219

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds and a tabu search algorithm

Lower bounds and a tabu search algorithm for

✍ Mathieu Bouchard; Alain Hertz; Guy Desaulniers 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 598 KB

Lower bounds and algorithms for flowtime

Lower bounds and algorithms for flowtime minimization on a single machine with set-up times

✍ Simon Dunstall; Andrew Wirth; Kenneth Baker 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 165 KB 👁 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this

A Linear Time Lower Bound on McCreight a

A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees

✍ Mauricio Ayala-Rincón; Paulo D. Conejo 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 157 KB

A composite branch and bound, cutting pl

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron

✍ Kurt M. Bretthauer; A.Victor Cabot 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 906 KB

A branch and bound-outer approximation a

A branch and bound-outer approximation algorithm for concave minimization over a convex set

✍ Harold P. Benson; Reiner Horst 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Fast and versatile algorithm for nearest

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

✍ Yong-Sheng Chen; Yi-Ping Hung; Ting-Fang Yen; Chiou-Shann Fuh 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 431 KB