✦ LIBER ✦

Better bounds on online unit clustering

✍ Scribed by Ehmsen, Martin R.; Larsen, Kim S.

Book ID: 121895277
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 917 KB
Volume: 500
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.07.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Better Bounds for Online Scheduling

✍ Albers, Susanne 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 350 KB

A Randomized Algorithm for Online Unit C

A Randomized Algorithm for Online Unit Clustering

✍ Timothy M. Chan; Hamid Zarrabi-Zadeh 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 326 KB

An Improved Algorithm for Online Unit Cl

An Improved Algorithm for Online Unit Clustering

✍ Hamid Zarrabi-Zadeh; Timothy M. Chan 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 291 KB

Better lower bounds on detecting affine

Better lower bounds on detecting affine and spherical degeneracies

✍ J. Erickson; R. Seidel 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 907 KB

Fast technique for unit commitment by ge

Fast technique for unit commitment by genetic algorithm based on unit clustering

✍ Senjyu, T.; Saber, A.Y.; Miyagi, T.; Shimabukuro, K.; Urasaki, N.; Funabashi, T. 📂 Article 📅 2005 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 304 KB

Bounds on the Size of the TBR Unit-Neigh

Bounds on the Size of the TBR Unit-Neighbourhood

✍ Peter J. Humphries 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 174 KB