4 search results - page 1 / 1 » A combinatorial approach to doubly transitive permutation gr... |
DM
2008
13 years 5 months ago
2008
SARA
2009
Springer
13 years 12 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...