New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

Author： V. N. Sastry   T. N. Janakiraman   S. Ismail Mohideen  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.82, Iss.3, 2005-03, pp. : 289-300

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

Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems

By Bonnel Henri   Yalçın Kaya C.  

Journal of Optimization Theory and Applications, Vol. 147, Iss. 1, 2010-10 ,pp. : 93-112

Springer Publishing Company

Access to resources Recommend Favorite

A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems

By Dutta Joydeep  

Optimization, Vol. 60, Iss. 8-9, 2011-08 ,pp. : 1091-1104

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms for shortest paths and d-cycle problems

By Bespamyatnikh S.   Kelarev A.  

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 1-9

Elsevier

Access to resources Recommend Favorite

A numerical method for nonconvex multi-objective optimal control problems

By Kaya C.   Maurer Helmut  

Computational Optimization and Applications, Vol. 57, Iss. 3, 2014-04 ,pp. : 685-702

Springer Publishing Company

Access to resources Recommend Favorite

Modified Algorithm to Compute Pareto-Optimal Vectors

By Sastry V.N.   Mohideen S.I.  

Journal of Optimization Theory and Applications, Vol. 103, Iss. 1, 1999-10 ,pp. : 241-244

Springer Publishing Company

Access to resources Recommend Favorite