𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient heuristic approach to solve the unate covering problem

✍ Scribed by Cordone, R.; Ferrandi, F.; Sciuto, D.; Calvo, R.W.

Book ID
119778835
Publisher
IEEE
Year
2001
Tongue
English
Weight
263 KB
Volume
20
Category
Article
ISSN
0278-0070

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A heuristic circulation-network approach
A heuristic circulation-network approach to solve the multi-traveling salesman problem
✍ Alberto Garcia-Diaz πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 561 KB

The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the

An adaptation of SH heuristic to the loc
An adaptation of SH heuristic to the location set covering problem
✍ Marcos AlmiΓ±ana; JesΓΊs T. Pastor πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 555 KB

In a recent paper, a new surrogate heuristic (SH) has been proposed for the set covering problem. Here we present an adaptation of it in order to solve more efficiently the location set covering problem. We will show that our new version not only outperforms algorithm SH but that it is more accurate