• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

A neural network for the minimum set covering problem

Zissimopoulos, Vassilis; Paschos, Vangelis; Hifi, Mhand (2000), A neural network for the minimum set covering problem, Chaos, Solitons and Fractals, 11, 13, p. 2079-2089. http://dx.doi.org/10.1016/S0960-0779(99)00104-6

Type
Article accepté pour publication ou publié
Date
2000
Journal name
Chaos, Solitons and Fractals
Volume
11
Number
13
Publisher
Elsevier
Pages
2079-2089
Publication identifier
http://dx.doi.org/10.1016/S0960-0779(99)00104-6
Metadata
Show full item record
Author(s)
Zissimopoulos, Vassilis
Paschos, Vangelis
Hifi, Mhand
Abstract (EN)
We solve approximately the weighted set covering problem by putting together a neural network model, the Boltzmann machine (BM), and some combinatorial ideas. We compare the solutions provided by the network with the ones obtained using the greedy set covering heuristic and the Lagrangian heuristic developed by Beasley. Moreover, we use a simple and intuitive polynomial decomposition schema treating large instances by decomposing them into smaller ones. Finally, we report on the relation between the convergence time of the model and the size of the instances of set covering.
Subjects / Keywords
Set covering

Related items

Showing items related by title and author.

  • Thumbnail
    A new efficient heuristic for minimum set covering problem 
    Afif, Mohamed; Hifi, Mhand; Paschos, Vangelis; Zissimopoulos, Vassilis (1995) Article accepté pour publication ou publié
  • Thumbnail
    A simulated annealing approach for the circular cutting problem 
    Zissimopoulos, Vassilis; Hifi, Mhand; Paschos, Vangelis (2004) Article accepté pour publication ou publié
  • Thumbnail
    On the approximation of NP-complete problems by using Boltzmann machine method. The cases of some covering and packing problems 
    Zissimopoulos, Vassilis; Paschos, Vangelis; Pekergin, Ferhan (1991) Communication / Conférence
  • Thumbnail
    On the approximation of NP-complete problems by using Boltzmann machine method: the cases of some covering and packing problems 
    Zissimopoulos, Vassilis; Paschos, Vangelis; Pekergin, Ferhan (1991) Article accepté pour publication ou publié
  • Thumbnail
    Probabilistic models for the Steiner Tree problem 
    Paschos, Vangelis; Telelis, Orestis; Zissimopoulos, Vassilis (2010) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo