Thumbnail - No thumbnail

Polynomial approximation: a structural and operational study

Escoffier, Bruno (2007), Polynomial approximation: a structural and operational study, 4OR, 5, 2, p. 161-164. http://dx.doi.org/10.1007/s10288-006-0027-z

Type
Article accepté pour publication ou publié
External document link
http://basepub.dauphine.fr/xmlui/handle/123456789/13371
Date
2007
Journal name
4OR
Volume
5
Number
2
Publisher
Springer
Pages
161-164
Publication identifier
Metadata
Show full item record
Author(s)
Escoffier, Bruno
Abstract (EN)
This is a summary of the most important results of the author’s PhD thesis. This thesis, supervised by Vangelis Th. Paschos, was defended in October 2005 at the Université Paris Dauphine. It is written in French and is available on-line. The thesis is focused on combinatorial optimization problems, studied from the standpoint of polynomial approximation theory. We were interested both in structural concerns (mainly completeness in approximation classes and logical expressivity) and operational ones (with the study of satisfiability, coloring and covering problems).
Subjects / Keywords
Combinatorial optimization; Approximation; Completeness; Differential ratio