✦ LIBER ✦

An algorithm for the committee construction problem

✍ Scribed by Demet Ceylan; Ömer Saatçioǧlu; Canan Sepil

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 635 KB
Volume: 77
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90028-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructive heuristic algorithms for th

Constructive heuristic algorithms for the open shop problem

✍ H. Bräsel; T. Tautenhahn; F. Werner 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 698 KB

An algorithm for the construction of lia

An algorithm for the construction of liapunov functions

✍ M.N. Oǧuztöreli; V. Lakshmikantham; S. Leela 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 860 KB

An algorithm for the longest cycle probl

An algorithm for the longest cycle problem

✍ E. T. Dixon; S. E. Goodman 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

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 SEGREGATED STORAGE

AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM

✍ A. W. Neebe; M. R. Rao 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 717 KB

## Abstract The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one

An algorithm for the minimax weber probl

An algorithm for the minimax weber problem

✍ Søren Kruse Jacobsen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 425 KB