Mon premier blog

Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz

Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou, Kenneth Steiglitz ebook
Publisher: Dover Publications
Page: 513
Format: djvu
ISBN: 0486402584, 9780486402581

In the recent post we discussed the question whether Microsoft Excel is a viable platform for developing and testing models and algorithms for complex combinatorial optimization problems. This is the theory of black-box optimization. They have been applied to solve different combinatorial optimization problems successfully. And it also naturally leads to algorithms that work in linear time, and which are thus well-suited for large-scale optimization. Areas of interest include (but are not limited to) algorithmics, approximation algorithms, algorithmic discrete mathematics, computational complexity and combinatorial optimization. Black-box optimization, oracle complexity. Combinatorial optimization Combinatorial optimization : algorithms and complexity / Christos H. Combinatorial Optimization - Algorithms and Complexity. Papadimitriou and Kenneth Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Corrected republication with a new preface, Dover. Their performance is very promising when they solve small problem instances. Combinatorial Optimization: algorithms and complexity - Christos H.