An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem

Author： de Sousa Ernando Gomes   Santos Andréa Cynthia   Aloise Dario José  

Publisher： Edp Sciences

E-ISSN： 1290-3868|49|1|143-160

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.49, Iss.1, 2014-12, pp. : 143-160

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

Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands∗

By Solano-Charris Elyn L.   Prins Christian   Santos Andréa Cynthia  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 689-714

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

An exact method to generate all nondominated spanning trees

By Boumesbah Asma   Chergui Mohamed El-Amine  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 857-867

Edp Sciences

Access to resources Recommend Favorite

Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints

By Sun Yan   Lang Maoxiang   Wang Danzhu  

International Journal of Environmental Research and Public Health, Vol. 13, Iss. 8, 2016-07 ,pp. : 762-762

MDPI

Access to resources Recommend Favorite

Typology of secondary cyanobacterial metabolites from minimum spanning tree analysis

By Doré J.C.  

SAR and QSAR in Environmental Research, Vol. 15, Iss. 2, 2004-04 ,pp. : 101-114

Taylor & Francis Ltd

Access to resources Recommend Favorite