Majid Zohrehbandian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Majid Zohrehbandian has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
F. Hosseinzadeh Lotfi
3 shared publications- Ahmad Makui
School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
2 shared publications G.R. Jahanshahloo
2 shared publications- Reza Farzipoor Saen
Department of Operations Management & Business Statistics, College of Economics and Political Science, Sultan Qaboos University, Muscat, Oman
2 shared publications A Alinezhad
Islamic Azad University – Qazvin Branch Qazvin Iran
1 shared publicationA. Alinezhad
1 shared publication
Latest Publications
- Open Access
A (1.999999)-approximation ratio for vertex cover problem
Until the authenticity of the unique games conjecture is proven, it can be thought to be false. Therefore, I request you, dear reader, to read this paper carefully, and if you don't find any mistake in it, think about the option that maybe unique games conjecture is not correct! If the unique games conjecture is true then it is impossible to produce a less than 2 approximation ratio for the vertex cover problem. Vertex cover problem is a famous combinatorial problem, which its complexity has been heavily studied over the years and while a 2-approximation for it can be trivially obtained, researchers have not been able to approximate it better than 2-\textit{o}(1). In this paper, by a combination of a new semidefinite programming formulation along with satisfying new proposed properties, we introduce an approximation algorithm for the vertex cover problem with a performance ratio of 1.999999 on arbitrary graphs, en route to answering an open question about the unique games conjecture.
Open AccessA (1.999999)-approximation ratio for vertex cover problem
Until the authenticity of the unique games conjecture is proven, it can be thought to be false. Therefore, I request you, dear reader, to read this paper carefully, and if you don't find any mistake in it, think about the option that maybe unique games conjecture is not correct! If the unique games conjecture is true then it is impossible to produce a less than 2 approximation ratio for the vertex cover problem. Vertex cover problem is a famous combinatorial problem, which its complexity has been heavily studied over the years and while a 2-approximation for it can be trivially obtained, researchers have not been able to approximate it better than 2-\textit{o}(1). In this paper, by a combination of a new semidefinite programming formulation along with satisfying new proposed properties, we introduce an approximation algorithm for the vertex cover problem with a performance ratio of 1.999999 on arbitrary graphs, en route to answering an open question about the unique games conjecture.
- 30 September 2024
- Published by Elsevier in Operations Research Letters
- Vol. 57
Optimality of DSatur algorithm on chordal graphs
- 30 September 2024
- Published by Elsevier in Operations Research Letters
- Vol. 57
Optimality of DSatur algorithm on chordal graphs
- Open Access
New insight into introducing a (2-\epsilon)-approximation ratio for minimum vertex cover problem
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, while a 2-approximation for it can be trivially obtained. In this paper, new properties and new techniques are introduced which lead to approximation ratios smaller than on special graphs. Then, by introducing a modified graph and corresponding model along with satisfying the proposed assumptions, we propose new insight into solving this open problem and we introduce an approximation algorithm with a performance ratio of on arbitrary graphs.
Open AccessNew insight into introducing a (2-\epsilon)-approximation ratio for minimum vertex cover problem
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, while a 2-approximation for it can be trivially obtained. In this paper, new properties and new techniques are introduced which lead to approximation ratios smaller than on special graphs. Then, by introducing a modified graph and corresponding model along with satisfying the proposed assumptions, we propose new insight into solving this open problem and we introduce an approximation algorithm with a performance ratio of on arbitrary graphs.
- Open Access
- 1 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
A Cross‐Efficiency Based Ranking Method for Finding the Most Efficient DMU
In many applications of DEA, ranking of DMUs and finding the most efficient DMU are desirable, as reported by Toloo (2013). In this paper, after introducing an improvement to the measure of cross‐efficiency by Jahanshahloo et al. (2011), we develop a new ranking method under the condition of variable returns to scale (VRS). Numerical example illustrates the effectiveness of the proposed cross‐efficiency based ranking method and demonstrates the advantages of our proposal, against the other ranking approaches.
- 1 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
Open AccessA Cross‐Efficiency Based Ranking Method for Finding the Most Efficient DMU
In many applications of DEA, ranking of DMUs and finding the most efficient DMU are desirable, as reported by Toloo (2013). In this paper, after introducing an improvement to the measure of cross‐efficiency by Jahanshahloo et al. (2011), we develop a new ranking method under the condition of variable returns to scale (VRS). Numerical example illustrates the effectiveness of the proposed cross‐efficiency based ranking method and demonstrates the advantages of our proposal, against the other ranking approaches.
- Open Access
- 1 October 2011
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 62 (10) , 1796-1800
Finding common weights based on the DM's preference information
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 October 2011
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 62 (10) , 1796-1800
Open AccessFinding common weights based on the DM's preference information
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 August 2011
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 35 (8) , 3769-3776
Using Zionts–Wallenius method to improve estimate of value efficiency in DEA
- 1 August 2011
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 35 (8) , 3769-3776
Using Zionts–Wallenius method to improve estimate of value efficiency in DEA
- 1 April 2010
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 61 (4) , 604-610
A compromise solution approach for finding common weights in DEA: an improvement to Kao and Hung's approach
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 April 2010
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 61 (4) , 604-610
A compromise solution approach for finding common weights in DEA: an improvement to Kao and Hung's approach
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 January 2010
- Published by Inderscience Publishers in International Journal of Mathematics in Operational Research
- Vol. 2 (4) , 456
A mathematical model for supplier selection in quantity discount environments
Supplier selection has received extensive attention in supply chain management (SCM). In this field, owing to the difficulty of treating non-linear functions, many SCM models assume that the prices of materials, production, transportation and inventory are constant. This is far beyond the real situations and, however, is not practical. In fact, vendors usually offer quantity discounts to encourage the buyers to order more, and the producer intends to discount the unit production cost if the amount of production is large. For dealing with this difficulty, this paper examines the application of data envelopment analysis, which has demonstrated potential as a management tool to overcome the shortcomings of other techniques and to help purchasing executives improve the efficiency of their operations.
- 1 January 2010
- Published by Inderscience Publishers in International Journal of Mathematics in Operational Research
- Vol. 2 (4) , 456
A mathematical model for supplier selection in quantity discount environments
Supplier selection has received extensive attention in supply chain management (SCM). In this field, owing to the difficulty of treating non-linear functions, many SCM models assume that the prices of materials, production, transportation and inventory are constant. This is far beyond the real situations and, however, is not practical. In fact, vendors usually offer quantity discounts to encourage the buyers to order more, and the producer intends to discount the unit production cost if the amount of production is large. For dealing with this difficulty, this paper examines the application of data envelopment analysis, which has demonstrated potential as a management tool to overcome the shortcomings of other techniques and to help purchasing executives improve the efficiency of their operations.
- 1 January 2009
- Published by Inderscience Publishers in International Journal of Procurement Management
- Vol. 2 (1) , 93
Technology selection with both quantitative and qualitative outputs
Technology selection is an important part of the management of technology. To select the best technologies, a practical common-weight Multi-Objective Linear Programming (MOLP) approach with an improved discriminating power is introduced. The proposed MOLP approach enables the evaluation of the relative efficiency of Decision-Making Units (DMUs) with respect to multiple exact and ordinal outputs and a single exact input. Its robustness and discriminating power are illustrated via a previously reported robot evaluation problem by comparing the ranking that is obtained by the proposed MOLP framework with that obtained by the classical Data Envelopment Analysis (DEA) model.
- 1 January 2009
- Published by Inderscience Publishers in International Journal of Procurement Management
- Vol. 2 (1) , 93
Technology selection with both quantitative and qualitative outputs
Technology selection is an important part of the management of technology. To select the best technologies, a practical common-weight Multi-Objective Linear Programming (MOLP) approach with an improved discriminating power is introduced. The proposed MOLP approach enables the evaluation of the relative efficiency of Decision-Making Units (DMUs) with respect to multiple exact and ordinal outputs and a single exact input. Its robustness and discriminating power are illustrated via a previously reported robot evaluation problem by comparing the ranking that is obtained by the proposed MOLP framework with that obtained by the classical Data Envelopment Analysis (DEA) model.
- 1 January 2008
- Published by Inderscience Publishers in International Journal of Procurement Management
- Vol. 1 (4) , 472
A data envelopment analysis approach to supplier selection in volume discount environments
Many practitioners and researchers have presented the advantages of supply chain management. In order to increase their competitive advantage, many companies consider that a well-designed and well-implemented supply chain system is an important tool. Under this condition, building on the closeness and long-term relationships between buyers and suppliers is a critical success factor to establish the supply chain system. Therefore, the supplier selection problem becomes the most important issue in implementing a successful supply chain system. Traditionally, many optimisation models of supplier selection assume that the average unit price of procured items is a constant. This assumption is not realistic because suppliers usually offer quantity discounts to encourage the buyers to order more. For dealing with this difficulty and for selecting the best suppliers with regard to multiple criteria, this paper introduces an innovative algorithm, which is based on Data Envelopment Analysis (DEA). A numerical example demonstrates the application of the proposed method.
- 1 January 2008
- Published by Inderscience Publishers in International Journal of Procurement Management
- Vol. 1 (4) , 472
A data envelopment analysis approach to supplier selection in volume discount environments
Many practitioners and researchers have presented the advantages of supply chain management. In order to increase their competitive advantage, many companies consider that a well-designed and well-implemented supply chain system is an important tool. Under this condition, building on the closeness and long-term relationships between buyers and suppliers is a critical success factor to establish the supply chain system. Therefore, the supplier selection problem becomes the most important issue in implementing a successful supply chain system. Traditionally, many optimisation models of supplier selection assume that the average unit price of procured items is a constant. This assumption is not realistic because suppliers usually offer quantity discounts to encourage the buyers to order more. For dealing with this difficulty and for selecting the best suppliers with regard to multiple criteria, this paper introduces an innovative algorithm, which is based on Data Envelopment Analysis (DEA). A numerical example demonstrates the application of the proposed method.