Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/999

 Title: Lagrangean Approximation for Combinatorial Inverse Problems Authors: Sahakyan, HasmikAslanyan, Levon Keywords: Approximation AlgorithmsLagragean 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. URI: http://hdl.handle.net/10525/999 ISSN: 1313-0455 Appears in Collections: Book 1 Algorithmic and Mathematical Foundations of the Artificial Intelligence

Files in This Item:

File Description SizeFormat