A neural computation approach to the set covering problem

PDF Version Also Available for Download.

Description

This paper presents a neural network algorithm which is capable of finding approximate solutions for unicost set covering problems. The network has two types of units (neurons), with different dynamics and activation functions. One type represents the objects to be covered (the rows in the matrix representation of the problem) and another represents the ``covering`` sets (the 0,1 variables). They are connected as a bipartite graph which represents the incidence relations between objects and sets (i.e the 0,1 adjacency matrix). When the parameters of the units are correctly tuned, the stable states of the system correspond to the minimal covers. ... continued below

Physical Description

8 p.

Creation Information

Grossman, T. July 1, 1995.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 53 times , with 5 in the last month . More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Author

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

This paper presents a neural network algorithm which is capable of finding approximate solutions for unicost set covering problems. The network has two types of units (neurons), with different dynamics and activation functions. One type represents the objects to be covered (the rows in the matrix representation of the problem) and another represents the ``covering`` sets (the 0,1 variables). They are connected as a bipartite graph which represents the incidence relations between objects and sets (i.e the 0,1 adjacency matrix). When the parameters of the units are correctly tuned, the stable states of the system correspond to the minimal covers. I show that in its basic mode of operation, descent dynamics, when the network is set in an arbitrary initial state it converges in less than 2n steps (where n is the number of variables), to a stable state which represents a valid solution. In this mode, the network implements a greedy heuristic in which the choice function is based on the unit inputs (which are determined by the activation functions and the network state). On top of the basic network dynamics, the algorithm applies an adaptive restart procedure which helps to search more effectively for ``good`` initial states and results in better performance.

Physical Description

8 p.

Notes

OSTI as DE95015316

Source

  • Neural information processing systems, Denver, CO (United States), Nov 1995

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE95015316
  • Report No.: LA-UR--95-1823
  • Report No.: CONF-9511123--1
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 106473
  • Archival Resource Key: ark:/67531/metadc627643

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • July 1, 1995

Added to The UNT Digital Library

  • June 16, 2015, 7:43 a.m.

Description Last Updated

  • Feb. 25, 2016, 9:50 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 5
Total Uses: 53

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Grossman, T. A neural computation approach to the set covering problem, article, July 1, 1995; New Mexico. (digital.library.unt.edu/ark:/67531/metadc627643/: accessed November 17, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.