A (1.999999)-approximation ratio for vertex cover problem

Autor: Zohrehbandian, Majid

The vertex cover problem is a famous combinatorial problem, and its complexity has been heavily studied. While a 2-approximation for it can be trivially obtained, researchers have not been able to approximate it better than 2-o(1). In this paper, by

Externí odkaz: http://arxiv.org/abs/2403.19680

New insight into introducing a (2-ℇ)-approximation ratio for minimum vertex cover problem

Autor: Zohrehbandian, Majid

Vertex cover problem is a famous combinatorial problem, which its complexity has been heavily studied over the years and we know that there is not any mathematical formulation that approximates it better than . In other words, it is known that it is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a030cc74a08997620c2163e69e9306f

A 3SDP relaxation to solve vertex cover problem

Autor: Zohrehbandian, Majid

Vertex cover problem is a famous combinatorial problem, which its complexity has been heavily studied. It is known that it is hard to approximate to within any constant factor better than 2. In this paper, based on the addition of new constraints to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f6abe5c7050ded2ddf9ff195bea2f00

A Cutting Plane Approach for Solving Linear Bilevel Programming Problems.

Autor: Jahanshahloo, Almas, Zohrehbandian, Majid

Publikováno v: Advanced Computational Methods for Knowledge Engineering: Proceedings of 3rd International Conference on Computer Science, Applied Mathematics & Applications - ICCSAMA 2015; 2015, p3-13, 11p

A mathematical model for supplier selection in quantity discount environments

Autor: Zohrehbandian, Majid, Saen, Reza Farzipoor

Publikováno v: International Journal of Mathematics in Operational Research; January 2010, Vol. 2 Issue: 4 p456-466, 11p