✦ 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
DOI: 10.1007/bf00940846

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existence and Approximation Results Invo

Existence and Approximation Results Involving Regularized Constrained Stackelberg Problems

✍ A. Aboussoror; P. Loridan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 540 KB

A polynomial approximation scheme for th

A polynomial approximation scheme for the subset sum problem

✍ Nei Yoshihiro Soma; Alan Solon Ivor Zinober; Horacio Hideki Yanasse; Peter John 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 462 KB

A parallel approximation scheme for the

A parallel approximation scheme for the multiprocessor scheduling problem

✍ 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

Approximation schemes for ordered vector

Approximation schemes for ordered vector packing problems

✍ Alberto Caprara; Hans Kellerer; Ulrich Pferschy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

A fully polynomial approximation scheme

A fully polynomial approximation scheme for the total tardiness problem

✍ E.L. Lawler 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 169 KB

A useful approximation scheme for Lagran

A useful approximation scheme for Lagrangians

✍ E. J. Balder 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 808 KB