𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A general reduction scheme for the time-dependent Born–Oppenheimer approximation

✍ Scribed by André Martinez; Vania Sordoni


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
61 KB
Volume
334
Category
Article
ISSN
1631-073X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A polynomial time approximation scheme f
✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 148 KB

In this paper we investigate the two-stage multiprocessor ow shop scheduling problem F2(P)| • |Cmax, where the numbers m1 and m2 of machines available in the two stages are part of the input. We demonstrate the existence of a polynomial time approximation scheme for this problem. This result solves