BulDML at Institute of Mathematics and Informatics >
International Book Series Information Science and Computing >
2008 >
Book 1 Algorithmic and Mathematical Foundations of the Artificial Intelligence >

Please use this identifier to cite or link to this item:

Title: Lagrangean Approximation for Combinatorial Inverse Problems
Authors: Sahakyan, Hasmik
Aslanyan, Levon
Keywords: Approximation Algorithms
Lagragean Relaxation
Issue Date: 2008
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of application problems. Basically these problems are NP-complete. The paper considers a set of such problems and introduces approximation algorithms for their solutions applying Lagragean relaxation and related set of techniques.
ISSN: 1313-0455
Appears in Collections:Book 1 Algorithmic and Mathematical Foundations of the Artificial Intelligence

Files in This Item:

File Description SizeFormat
IBS-01-p02.pdf173.4 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License