When polynomial approximation meets exact computation
Year of publication: |
2015
|
---|---|
Authors: | Paschos, Vangelis Th. |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 13.2015, 3, p. 227-245
|
Subject: | Complexity | Polynomial approximation | Exact algorithm | Moderately exponential approximation | Mathematische Optimierung | Mathematical programming | Schätztheorie | Estimation theory | Algorithmus | Algorithm |
-
D-optimal Data Fusion : exact and approximation algorithms
Li, Yongchun, (2024)
-
Critical edges for the assignment problem : complexity and exact resolution
Bazgan, Cristina, (2013)
-
Super-polynomial approximation branching algorithms
Escoffier, Bruno, (2016)
- More ...
-
On the performance of congestion games for optimum satisfiability problems
Giannakos, Aristotelis, (2007)
-
Della Croce, Federico, (2008)
-
On the max-weight edge coloring problem
Lucarelli, Giorgio, (2010)
- More ...