A NEW APPROACH FOR VARIANT MULTI ASSIGNMENT PROBLEM

Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 5

Abstract

A large number of real-world planning problems called Combinatorial Optimization Problems share the following properties: They are Optimization Problems, are easy to state, and have a finite but usually very large number of feasible olutions. Lexi-Search is by far the mostly used tool for solving large scale NP-hard Combinatorial Optimization problems. Lexi-Search is, however, an algorithm paradigm, which has to be filled out for each specific problem type, and numerous hoices for each of the components exist. Even then, principles for the design of efficient Lexi-Search algorithms have emerged over the years. Although Lexi-Search methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter. The motivation of the calculation of the lower bounds is based on ideas frequently used in solving problems. Computationally, the algorithm extended the size of problem and find better solution.

Authors and Affiliations

SOBHAN BABU. K , CHANDRA KALA. K , PURUSHOTTAM. S , SUNDARA MURTHY. M

Keywords

Related Articles

Design and Analysis of Fuzzy Metagraph Based Data Structures

Fuzzy metagraph is an emerging technique used in the design of many information processing systems like transaction processing systems, decision support systems, and workflow systems. Very often, even a carefully chosen...

Adaptive Enhancement of routing protocol under CBR and TCP traffic source

The main objective of this article is to study and enhance on demand routing protocol under different traffic consideration so that our proposed routing protocol give an better result then other reactive and proactive ro...

Implementation and Performance Evaluation of the Gateway Discovery Approaches in the Integrated MANETInternet Scenario

The mobile ad hoc networks have become a major component of the future network development due to their ease of deployment, self-configurability, flexibility and independence on any existing network infrastructure. But...

Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network

Mobile ad hoc networks are formed by co operative association of wireless nodes communicating with each other without the use of infrastructure. Every node acts as a router in the network and enables the communication be...

A Survey of QOS with IEEE 802.11e

IP is the fundamental protocol of Internet. It provides best efforts service. It has no in-built mechanisms to provide Quality of service. Some of the applications that are being used in Internet require Quality of servi...

Download PDF file
  • EP ID EP85427
  • DOI -
  • Views 125
  • Downloads 0

How To Cite

SOBHAN BABU. K, CHANDRA KALA. K, PURUSHOTTAM. S, SUNDARA MURTHY. M (2010). A NEW APPROACH FOR VARIANT MULTI ASSIGNMENT PROBLEM. International Journal on Computer Science and Engineering, 2(5), 1633-1640. https://europub.co.uk/articles/-A-85427