125 search results - page 2 / 25 » An Efficient Heuristic Approach to Solve the Unate Covering ... |
CSC
2008
13 years 6 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
IICAI
2003
13 years 6 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
EOR
2008
13 years 4 months ago
2008
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
COR
2010
13 years 5 months ago
2010
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retai...
FPL
1997
Springer
13 years 9 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...