![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Kavitha Telikepalli Nasre Meghana Nimbhorkar Prajakta
Publisher: Springer Publishing Company
ISSN: 1382-6905
Source: Journal of Combinatorial Optimization, Vol.27, Iss.3, 2014-04, pp. : 574-596
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum Tree Cost Quartet Puzzling
Journal of Classification, Vol. 27, Iss. 2, 2010-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum cost time-varying network flow problems
By Nasrabadi Ebrahim Hashemi S. Mehdi
Optimization Methods and Software, Vol. 25, Iss. 3, 2010-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Capacity inverse minimum cost flow problem
By Güler Çiğdem Hamacher Horst
Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum-cost flow algorithms: an experimental evaluation
By Kovács Péter
Optimization Methods and Software, Vol. 30, Iss. 1, 2015-01 ,pp. :