✦ LIBER ✦

A hybrid Tabu-ascent algorithm for the linear Bilevel Programming Problem

✍ Scribed by M. Gendreau; P. Marcotte; G. Savard

Publisher: Springer US
Year: 1996
Tongue: English
Weight: 725 KB
Volume: 8
Category: Article
ISSN: 0925-5001
DOI: 10.1007/bf00121266

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming algorithm for the

A dynamic programming algorithm for the bilevel knapsack problem

✍ Luce Brotcorne; Saïd Hanafi; Raïd Mansi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 940 KB

A simple Tabu Search method to solve the

A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem

✍ U.P. Wen; A.D. Huang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 652 KB

An algorithm for the discrete bilevel pr

An algorithm for the discrete bilevel programming problem

✍ Jonathan F. Bard; James T. Moore 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting

Efficient solutions for the linear bilev

Efficient solutions for the linear bilevel programming problem

✍ Ue-Pyng Wen; Shuh-Tzy Hsu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 610 KB

Test problem construction for linear bil

Test problem construction for linear bilevel programming problems

✍ Khosrow Moshirvaziri; Mahyar A. Amouzegar; Stephen E. Jacobsen 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 399 KB

The hybrid algorithm for solving the thr

The hybrid algorithm for solving the three-level linear programming problem

✍ Wen Ue-Pyng; Wayne F. Bialas 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 835 KB