A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629)
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 simple tabu search method to solve the mixed-integer linear bilevel programming problem |
scientific article; zbMATH DE number 1208571
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple tabu search method to solve the mixed-integer linear bilevel programming problem |
scientific article; zbMATH DE number 1208571 |
Statements
A simple tabu search method to solve the mixed-integer linear bilevel programming problem (English)
0 references
7 October 1998
0 references
heuristic algorithm
0 references
multilevel programming
0 references
decentralized planning problems
0 references
hierarchical planning
0 references
mixed-integer linear bilevel programming
0 references
simple tabu search
0 references
0 references
