✦ LIBER ✦

A Hard Dial-a-Ride Problem that is Easy on Average

✍ Scribed by Amin Coja-Oghlan; Sven O. Krumke; Till Nierhoff

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 138 KB
Volume: 8
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-005-6811-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-Line Dial-a-Ride Problems Under a Res

On-Line Dial-a-Ride Problems Under a Restricted Information Model

✍ Maarten Lipmann; Xiwen Lu; Willem E. de Paepe; Rene A. Sitters; Leen Stougie 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 158 KB

A note on “Efficient feasibility testing

A note on “Efficient feasibility testing for dial-a-ride problems”

✍ Jiafu Tang; Yuan Kong; Henry Lau; Andrew W.H. Ip 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Secret sharing based on a hard-on-averag

Secret sharing based on a hard-on-average problem

✍ P. Caballero-Gil; C. Hernández-Goya 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 88 KB

Three is easy, two is hard: open shop su

Three is easy, two is hard: open shop sum-batch scheduling problem refined

✍ Irina V. Gribkovskaia; Chung-Yee Lee; Vitaly A. Strusevich; Dominique de Werra 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 151 KB

For the two-machine open shop sum-batch problem to minimize the makespan an optimal schedule is known to contain one, two or three batches on each machine, and finding a two-batch optimal schedule is NP-hard. We adapt the open shop algorithm by de Werra for finding a three-batch optimal schedule in

A problem that is easier to solve on the

A problem that is easier to solve on the unit-cost algebraic RAM

✍ Prasoon Tiwari 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Scattering problem for a slowly decreasi

Scattering problem for a slowly decreasing potential that is periodically dependent on time

✍ E. L. Korotyaev 📂 Article 📅 1983 🏛 Springer US 🌐 English ⚖ 120 KB