Combinatorial complexity: are we on the right way?

Authors:
Robin Gremlich;Andreas Hamfelt;Héctor de Pereda;Vladislav Valkovsky
Affiliations:
Department of Information Science, Uppsala University, Uppsala, Sweden;Department of Information Science, Uppsala University, Uppsala, Sweden;Department of Information Science, Uppsala University, Uppsala, Sweden;Department of Information Science, Uppsala University, Uppsala, Sweden
Venue:
AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
Year:
2006

Citing 2
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Reduced Cost-Based Ranking for Generating Promising Subproblems

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

Applying the new primer on prime numbers

WSEAS Transactions on Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a hypothetical approach to support existing methods in dealing with combinatorial complexity and describe the application of said approach to some typical combinatorial problems and techniques.