An Approximate Algorithm for Triangle TSP with a Four-Vertex-Three-Line Inequality

Publisher： IGI Global_journal

E-ISSN： 1947-8291|6|1|35-46

ISSN： 1947-8283

Source： International Journal of Applied Metaheuristic Computing (IJAMC), Vol.6, Iss.1, 2015-01, pp. : 35-46

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

35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality

By Kowalik Lukasz   Mucha Marcin  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 240-255

Springer Publishing Company

Access to resources Recommend Favorite

Fast mutual exclusion by the Triangle algorithm

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 30, Iss. 4, 2018-02 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

An exact algorithm for solving the vertex separator problem

By Didi Biha Mohamed   Meurs Marie-Jean  

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 425-434

Springer Publishing Company

Access to resources Recommend Favorite

A Relaxed Approximate Proximal Point Algorithm

By Yang Zhenhua   He Bingsheng  

Annals of Operations Research, Vol. 133, Iss. 1-4, 2005-01 ,pp. : 119-125

Springer Publishing Company

Access to resources Recommend Favorite

A simple on-line harmonics elimination PWM algorithm for a three-phase voltage source inverter based on quadratic curve fittings

By Salam Z.  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 29, Iss. 3, 2010-01 ,pp. : 727-744

Emerald Group Publishing Ltd

Access to resources Recommend Favorite