Approximating values and solutions of NP-optimization problems: Concepts and examples.

We shape a formal framework for distinguishing the behaviour of constructive and non-constructive polynomial time approximation algorithms for NP optimization problems. We introduce a new class, called SubNPO, that includes NPO and also some other problems used in recent works.

MoreLess

Year of publication:	1999
Authors:	Demange, M. ; Lorenzo, J.
Institutions:	Centre de recherche de mathématiques et économie mathématique (CERMSEM), Centre d'Économie de la Sorbonne
Subject:	BEHAVIOUR \| MATHEMATICAL ANALYSIS \| PROBABILITY

More details

Series:	Papiers d'Economie Mathématique et Applications.
Type of publication:	Book / Working Paper
Notes:	20 pages
Classification:	C51 - Model Construction and Estimation ; C44 - Statistical Decision Theory; Operations Research
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005630682