This project includes the constraint programming (CP) models presented in the paper New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem, IJCAI 2023. The vertex ...
Abstract: Graph coloring is a well-known combinatorial optimization problem with broad applications in network security, scheduling, and register allocation. Being an NP-hard problem, exact solutions ...
np-complete-program-solver/ ├── src/ │ ├── problems/ # NP-complete 문제 정의 │ ├── solvers/ # 다양한 솔버 구현 │ │ ├── traditional/ # 전통적 알고리즘 │ │ ├── ml/ # 머신러닝 기반 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results