๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A theoretical approximation scheme for Stackelberg problems

โœ Scribed by P. Loridan; J. Morgan


Publisher
Springer
Year
1989
Tongue
English
Weight
728 KB
Volume
61
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A parallel approximation scheme for the
โœ Ricardo C. Corrรชa ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 433 KB

In this paper, a parallel branch-and-bound approach for ยฎnding approximate solutions to a general version of the multiprocessor scheduling problem is presented and analyzed. In this approach, a list heuristic and a genetic algorithm are used to ยฎnd solutions to the subproblems enumerated during the