A note on exact algorithms for the bottleneck generalized assignment problem

Article Abstract:

The performance of two exact algorithms for solving the bottleneck generalized assignment problem are compared in terms of their computational complexity. The two are the Mazzola-Neebe algorithm and the Martello-Toth algorithm. The comparison, which was conducted over ten random instances, was made to enable readers to evaluate the two procedures on an equal footing since the two were applied to different sets of randomly generated test problems when they were first introduced.

Evaluation, Computational complexity, Computational complexity (Machine theory)

---

The bottleneck generalized assignment problem

Article Abstract:

The min-max formulation of the generalized assignment problem (GAP), otherwise known as the bottleneck GAP (BGAP), encountered during scheduling and resource allocation is evaluated. Specifically, lower bounds for the problem are derived, some of which lead to min-max versions of the bottleneck knapsack problems. An exact branch-and-bound and approximate algorithms for obtaining a direct solution to the problem are also introduced.

Relaxation methods (Mathematics)

---

New trends in exact algorithms for the 0-1 knapsack problem

Article Abstract:

Recent methods for solving hard knapsack problems are reviewed.

Management, Usage, Algorithms

Similar abstracts:

• Abstracts: Clearing the bottlenecks. Moving cargo fast
• Abstracts: UK: Abbey National to boost mortgage lending. UK: Sub-prime lenders and Namba sign deal. UK: PRIVATE LABEL STARTS CORRESPONDENCE LENDING
• Abstracts: IDG slates $1 billion investment for the Internet sector. Some fear privacy imperiled. Asia's dot-coms regroup
• Abstracts: Inevitable. The art of the possible. Half steam ahead
• Abstracts: Healtheon says it plans to merge with WebMD. Misys offers to buy DBS Management. U.S. clears Healtheon deal

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.