Super-polynomial approximation branching algorithms
Year of publication: |
October-December 2016
|
---|---|
Authors: | Escoffier, Bruno ; Paschos, Vangelis Th. ; Tourniaire, Emeric |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 50.2016, 4/5, p. 979-994
|
Subject: | Branching algorithm | moderately exponential approximation | approximation schema | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
When polynomial approximation meets exact computation
Paschos, Vangelis Th., (2015)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Moderately exponential time and fixed parameter approximation algorithms
Escoffier, Bruno, (2013)
-
Differential approximation of min sat, max sat and related problems
Escoffier, Bruno, (2007)
-
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
Escoffier, Bruno, (2010)
- More ...