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
- EP ID EP85427
- DOI -
- Views 109
- Downloads 0
IROBOT CREATE: PROGRAMMED AS PROVIDER
This paper elucidates the research and implementation of guiding robots to a predetermined path. The robot is programmed through an 8 bit micro controller. The input to the robot for a particular path can be given by pre...
Global Chaos Synchronization of the Hyperchaotic Qi Systems by Sliding Mode Control
This paper investigates the problem of global chaos synchronization of identical hyperchaotic Qi systems (2008) by sliding mode control. The stability results derived in this paper for the synchronization of identical hy...
Processor-Directed Cache Coherence Mechanism – A Performance Study
Cache coherent multiprocessor architecture is widely used in the recent multi-core systems, embedded systems and massively parallel processors. With the ever increasing performance gap between processor and memory, ther...
SOFTWARE ARCHITECTURE RECOVERY WITH ERROR TOLERANCE AND PENALTY COST IN GRAPH MINING
In the vast literature Software architecture has been recovered through graphs During Software Architecture recovery generally matching will takes place between Source graph and Query graph. Graph matching is one of the...
Implementation Challenges of an Enterprise System and Its Advantages over Legacy Systems
This paper explores the implementation challenges of Enterprise Resource Planning in the industry and its advantages over legacy systems. The paper depicts the historical background of ERPs and their significance in faci...