𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem

✍ Scribed by Felipe Martins Müller; Mauro Marafiga Camozzato; Olinto César Bassi de Araújo

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
253 KB
Volume
7
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact algorithms for the master ring pro
Exact algorithms for the master ring problem
✍ Hadas Shachnai; Lisa Zhang; Tomomi Matsui 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

## Abstract We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings __R__~1~,…,__R__~__K__~, with __n__~1~,…,__n__~__K__~ distinct nodes, respectively, we need to find an ordering of the nodes in

Some exact algorithms for the knapsack s
Some exact algorithms for the knapsack sharing problem
✍ Takeo Yamada; Mayumi Futakawa; Seiji Kataoka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 446 KB

The knapsack sharing problem (KSP) is formulated as an extension to the ordinary knapsack problem. The KSP is .AlP-hard. We present a branch-and-bound algorithm and a binary search algorithm to solve this problem to optimality. These algorithms are implemented and computational experiments are carde