Efficient solution generation for the bicriterion shortest path problems

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.9, Iss.3, 2010-09, pp. : 287-305

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

Generating efficient faces for multiobjective linear programming problems

By Masri Hela Krichen Saoussen Guitouni Adel

International Journal of Operational Research, Vol. 15, Iss. 1, 2012-07 ,pp. : 1-15

Inderscience Publishers

Access to resources Recommend Favorite

Computing the Nash solution for scheduling bargaining problems

By Agnetis Alessandro Pascale Gianluca De Pranzo Marco

International Journal of Operational Research, Vol. 6, Iss. 1, 2009-05 ,pp. : 54-69

Inderscience Publishers

Access to resources Recommend Favorite

Solution of classical transport problems with bee algorithms

By Gomez Alberto

International Journal of Logistics Systems and Management, Vol. 15, Iss. 2-3, 2013-05 ,pp. : 160-170

Inderscience Publishers

Access to resources Recommend Favorite

An efficient ant colony system for Vehicle Routing Problems with Time Windows

By Leal Orivalde S. Silva

International Journal of Logistics Systems and Management, Vol. 10, Iss. 2, 2011-09 ,pp. : 224-240

Inderscience Publishers

Access to resources Recommend Favorite

Genetic algorithms-baes solution approach to combinatorial optimisation problems

By Kamrani Ali K. Gonzalez Ricardo

International Journal of Knowledge Management Studies, Vol. 2, Iss. 4, 2008-07 ,pp. : 499-518

Inderscience Publishers

Access to resources Recommend Favorite