Lagrangean relaxation-based algorithm for bi-level problems

Author： Rahmani A.   MirHassani S.A.  

Publisher： Taylor & Francis Ltd

E-ISSN： 1029-4937|30|1|1-14

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.30, Iss.1, 2015-01, pp. : 1-14

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

A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem

By Marinakis Yannis   Migdalas Athanasios   Pardalos Panos  

Journal of Combinatorial Optimization, Vol. 10, Iss. 4, 2005-12 ,pp. : 311-326

Springer Publishing Company

Access to resources Recommend Favorite

Direct search algorithm for bilevel programming problems

By Mersha Ayalew   Dempe Stephan  

Computational Optimization and Applications, Vol. 49, Iss. 1, 2011-05 ,pp. : 1-15

Springer Publishing Company

Access to resources Recommend Favorite

Bilevel programming with discrete lower level problems

By Fanghanel Diana  

Optimization, Vol. 58, Iss. 8, 2009-11 ,pp. : 1029-1047

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new equivalent single-level problem for bilevel problems

By Dempe S.   Gadhi N.  

Optimization, Vol. 63, Iss. 5, 2014-05 ,pp. : 789-798

Taylor & Francis Ltd

Access to resources Recommend Favorite

Management and performance evaluation of DSR aggregator based on a bi‐level optimization model

By  

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, Vol. 13, Iss. 3, 2018-03 ,pp. : 432-441

John Wiley & Sons Inc

Access to resources Recommend Favorite