On computational search for optimistic solutions in bilevel problems

Author： Strekalovsky Alexander Orlov Andrey Malyshev Anton

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.48, Iss.1, 2010-09, pp. : 159-172

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Proximal methods for a class of bilevel monotone equilibrium problems

By Moudafi Abdellatif

Journal of Global Optimization, Vol. 47, Iss. 2, 2010-06 ,pp. : 287-292

Springer Publishing Company

Access to resources Recommend Favorite

Model transformation testing: a bi‐level search‐based software engineering approach

JOURNAL OF SOFTWARE: EVOLUTION AND PROCESS (ELECTRONIC), Vol. 27, Iss. 11, 2015-11 ,pp. : 821-837

John Wiley & Sons Inc

Access to resources Recommend Favorite

COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS

By Nishizaki Ichiro Sakawa Masatoshi

Cybernetics and Systems, Vol. 31, Iss. 2, 2000-03 ,pp. : 203-221

Taylor & Francis Ltd

Access to resources Recommend Favorite

COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS

By Nishizaki Ichiro Sakawa Masatoshi

Cybernetics and Systems, Vol. 36, Iss. 6, 2005-09 ,pp. : 565-579

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points

By Campêlo Manoel Scheimberg Susana

Annals of Operations Research, Vol. 138, Iss. 1, 2005-09 ,pp. : 143-157

Springer Publishing Company

Access to resources Recommend Favorite