An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs

Author： Ibrahim Mamane Souley   Maculan Nelson   Ouzia Hacène  

Publisher： Edp Sciences

E-ISSN： 1290-3868|50|3|665-675

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.50, Iss.3, 2016-08, pp. : 665-675

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

An analytic center cutting plane algorithm for finding equilibrium points

By Raupp Fernanda M.P.   Sosa Wilfredo  

RAIRO - Operations Research, Vol. 40, Iss. 1, 2006-07 ,pp. : 37-52

Edp Sciences

Access to resources Recommend Favorite

Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic∗

By Laforest Christian   Phan Raksmey  

RAIRO - Operations Research, Vol. 47, Iss. 3, 2013-05 ,pp. : 199-221

Edp Sciences

Access to resources Recommend Favorite

Efficient weighted expressions conversion

By Ouardi Faissal   Ziadi Djelloul  

RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 2, 2007-09 ,pp. : 285-307

Edp Sciences

Access to resources Recommend Favorite

The code problem for directed figures

By Kolarz Michał  

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 4, 2011-02 ,pp. : 489-506

Edp Sciences

Access to resources Recommend Favorite

Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm

By Yin Lvjiang   Li Xinyu   Lu Chao   Gao Liang  

Sustainability, Vol. 8, Iss. 12, 2016-12 ,pp. : 1268-1268

MDPI

Access to resources Recommend Favorite