Shin ISHII, Masa-aki SATO
Doubly constrained network for
combinatorial optimization
Abstract:In this paper, we propose a new approach for solving combinatorial optimization
problems having two competing sets of constraints. In our approach, those constraints
are treated as “hard,” namely, they hold automatically. Experimental results for traveling
salesman problems show that our approach can obtain better solutions even for
large-scale problems than binary or Potts spin approaches.