Approximative combinatirial algorithms
Year of publication: |
1984
|
---|---|
Authors: | Kannan, Ravindran |
Other Persons: | Korte, Bernhard (contributor) |
Published in: |
Mathematical programming : proceedings of the International Congress on Mathematical Programming Rio de Janeiro, Brazil, 6-8 April, 1981. - Amsterdam [u.a.] : North-Holland, ISBN 0-444-86821-6. - 1984, p. 195-248
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
-
A simple algorithm for solving Ramsey optimal policy with exogenous forcing variables
Chatelain, Jean-Bernard, (2017)
- More ...
-
Exponentielle untere Komplexitätsschranken für eine Klasse von Knapsack-Problemen
Korte, Bernhard, (1979)
-
Approximative combinatorial algorithms
Kannan, Ravindran, (1978)
-
Exponential lower bounds on a class of knapsack algorithms
Hausmann, Dirk, (1977)
- More ...