✦ LIBER ✦

An algorithm for solving the multi-period online fulfillment assignment problem

✍ Scribed by Stephen Mahar; Kurt M. Bretthauer; M.A. Venkataramanan

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 752 KB
Volume: 50
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2009.04.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the traffic assignment

An algorithm for the traffic assignment problem

✍ Andrés Weintraub; Jaime González 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 667 KB

An algorithm for the multiprocessor assi

An algorithm for the multiprocessor assignment problem

✍ V.F. Magirou; J.Z. Milis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 380 KB

An algorithm for the multiinput pole ass

An algorithm for the multiinput pole assignment problem

✍ Rafael Bru; Juana Cerdán; Ana M. Urbano 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 480 KB

An algorithm for the bottleneck generali

An algorithm for the bottleneck generalized assignment problem

✍ Joseph B. Mazzola; Alan W. Neebe 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 737 KB

An algorithm for solving the jump number

An algorithm for solving the jump number problem

✍ Maciej M. Sysło 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 672 KB

An algorithm for solving the obstacle pr

An algorithm for solving the obstacle problems

✍ Lian Xue; Xiao-Liang Cheng 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 365 KB

ln this paper, we propose an algorithm for solving the obstacle problem. We try to find the approximated region of the contact in the obstacle problem by iteration. Numerical examples are given for the obstacle problem for a membrane and the elastic-plastic torsion problem. (~) 2004 Elsevier Ltd. Al