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 | Algorithmus | Algorithm | Schätztheorie | Estimation theory | Stochastischer Prozess | Stochastic process |
-
Lian, Deheng, (2024)
-
Nonadaptive stochastic score classification and explainable half-space evaluation
Ghuge, Rohan, (2025)
-
Parameter learning and change detection using a particle filter with accelerated adaptation
Gellert, Karol, (2021)
- More ...
-
When polynomial approximation meets exact computation
Paschos, Vangelis Th., (2018)
-
Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7
Paschos, Vangelis Th., (2018)
-
A simulated annealing approach for the circular cutting problem
Hifi, Mhand, (2004)
- More ...