An Extension Matrix Approach To The General Covering Problem | Zendy

Jiarong Hong | Zendy; Ryszard S. Michalski | Zendy; Carl Uhrik | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Extension Matrix Approach To The General Covering Problem

Author(s) -

Jiarong Hong,

Ryszard S. Michalski,

Carl Uhrik

Publication year - 1986

Publication title -

proceedings of spie, the international society for optical engineering/proceedings of spie

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.192

H-Index - 176

eISSN - 1996-756X

pISSN - 0277-786X

DOI - 10.1117/12.964180

Subject(s) - computer science , extension (predicate logic) , variety (cybernetics) , heuristic , matrix (chemical analysis) , mathematical optimization , scale (ratio) , algorithm , theoretical computer science , artificial intelligence , mathematics , programming language , materials science , physics , quantum mechanics , composite material

A new approach, called the extension matrix (EM) approach, for describing and solving the general covering problem (GCP) is proposed. The paper emphasizes that the GCP is NP-hard and describes an approximately optimal covering algorithm, AE1. AE1 incorporates the EM approach with a variety of heuristic search strategies. Results show the new algorithm to be efficient and useful for large scale problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research