A hybrid tabu-ascent algorithm for the linear bilevel programming problem (Q1815061)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A hybrid tabu-ascent algorithm for the linear bilevel programming problem |
scientific article; zbMATH DE number 941320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid tabu-ascent algorithm for the linear bilevel programming problem |
scientific article; zbMATH DE number 941320 |
Statements
A hybrid tabu-ascent algorithm for the linear bilevel programming problem (English)
0 references
10 April 1997
0 references
linear bilevel programming
0 references
linear hirarchical decision process
0 references
NP-hard problem
0 references
adaptive search
0 references
Tabu Search
0 references
0.9208759
0 references
0.8997442
0 references
0.89068323
0 references
0 references
0.8867356
0 references
0.8858958
0 references
