Iterated exact and heuristic algorithms for the minimum cost bipartite perfect matching problem with conflict constraints

2017 ◽  
Author(s):  
T. Oncan ◽  
I. K. Altinel
Keyword(s):  
Perfect Matching ◽  
Heuristic Algorithms ◽  
Minimum Cost ◽  
Matching Problem

The minimum cost perfect matching problem with conflict pair constraints

2013 ◽  
Vol 40 (4) ◽  
pp. 920-930 ◽  
Author(s):  
Temel Öncan ◽  
Ruonan Zhang ◽  
Abraham P. Punnen
Keyword(s):  
Perfect Matching ◽  
Minimum Cost ◽  
Matching Problem

scholarly journals Performance Evaluation of Meta-Heuristic Algorithms for Task Scheduling in Cloud Environment

2021 ◽  
pp. 87-93
Author(s):  
Jai Bhagwan ◽  
Sanjeev Kumar
Keyword(s):  
Task Scheduling ◽  
Heuristic Algorithms ◽  
Minimum Cost ◽  
Pso Algorithm ◽  
Cloud Services ◽  
Positive Role ◽  
Current Time ◽  
Heuristic Technique ◽  
Software Services ◽  
Cost Factors

Cloud Computing is one of the important fields in the current time of technological era. Here, the resources are available virtually for users according to pay-per-usage. Many industries are providing cloud services nowadays as pay for usage which reduces the computing cost drastically. The updated software services, hardware services can be provided to the user at a minimum cost. The target of the industries and scientists is to reduce the computing cost by various technologies. Resource management or task scheduling may also play a positive role in this regard. There are various virtual machine management algorithms available that can be tested and enhanced for research and benefit of the society. In this paper, three famous Max-Min, Ant Colony Optimization, and Particle Swarm Optimization algorithms have been used for experiments. After simulation results, it is found that the PSO algorithm is performing well for makes pan and cost factors. Further, a new algorithm can be proposed or a meta-heuristic technique can be enhanced or modified for getting better results.

scholarly journals A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs

2018 ◽  
pp. 457-476
Author(s):  
Mudabir Kabir Asathulla ◽  
Sanjeev Khanna ◽  
Nathaniel Lahn ◽  
Sharath Raghvendra
Keyword(s):  
Planar Graphs ◽  
Perfect Matching ◽  
Minimum Cost
Sign in / Sign up

Export Citation Format

Share Document