A Branch and Bound algorithm for the minimax regret spanning arborescence

Author: Conde Eduardo  

Publisher: Springer Publishing Company

ISSN: 0925-5001

Source: Journal of Global Optimization, Vol.37, Iss.3, 2007-03, pp. : 467-480

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