An exact algorithm for bilevel 0-1 knapsack problems
In this paper, we propose a new exact method for solving bilevel 0-1 knapsack problems. A bilevel problem models a hierarchical decision process that involves two decision makers called the leader and the follower. In these processes, the leader takes his decision by considering explicitly the react...
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Language: | eng |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/15194 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/15194 |