A computational method using genetic algorithms for obtaining Stackelberg solutions to two‐level linear programming problems
暂无分享,去创建一个
[1] Pierre Hansen,et al. New Branch-and-Bound Rules for Linear Bilevel Programming , 1989, SIAM J. Sci. Comput..
[2] Jonathan F. Bard,et al. A Branch and Bound Algorithm for the Bilevel Programming Problem , 1990, SIAM J. Sci. Comput..
[3] G. Anandalingam,et al. A penalty function approach for solving bi-level linear programs , 1993, J. Glob. Optim..
[4] Jonathan F. Bard,et al. Coordination of a multidivisional organization through two levels of management , 1983 .
[5] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.
[6] Jonathan F. Bard,et al. An explicit solution to the multi-level programming problem , 1982, Comput. Oper. Res..
[7] Patrice Marcotte,et al. Network design problem with congestion effects: A case of bilevel programming , 1983, Math. Program..
[8] G. Anandalingam. Artificial Intelligence Based Approaches for Solving Hierarchical Optimization Problems , 1989 .
[9] J. Bard,et al. Nondifferentiable and Two-Level Mathematical Programming , 1996 .
[10] J. Bard,et al. Determining Tax Credits for Converting Nonfood Crops to Biofuels: An Application of Bilevel Programming , 1998 .
[11] José Fortuny-Amat,et al. A Representation and Economic Interpretation of a Two-Level Programming Problem , 1981 .
[12] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[13] Wayne F. Bialas,et al. Two-Level Linear Programming , 1984 .
[14] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .