Rajesh, J. ; Gupta, Kapil ; Kusumakar, Hari Shankar ; Jayaraman, V. K. ; Kulkarni, B. D. (2003) A tabu search based approach for solving a class of bilevel programming problems in chemical engineering Journal of Heuristics, 9 (4). pp. 307-319. ISSN 1381-1231
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/n42wx6u7311111...
Related URL: http://dx.doi.org/10.1023/A:1025699819419
Abstract
In this paper an approach based on the tabu search paradigm to tackle the bilevel programming problems is presented. The algorithm has been tested for a number of benchmark problems and the results obtained show superiority of the approach over the conventional methods in solving such problems.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| Keywords: | Bilevel Programming; Tabu Search |
| ID Code: | 17288 |
| Deposited On: | 16 Nov 2010 08:02 |
| Last Modified: | 06 Jun 2011 09:08 |
Repository Staff Only: item control page
