150 search results - page 1 / 30 » Solving Small TSPs with Constraints |
81
Voted
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
80
Voted
IJCNN
2000
IEEE
15 years 1 months ago
2000
IEEE
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
MICAI
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a particle swarm optimizer for solving constrained optimization problems which adopts a very small population size (five particles). The proposed approach uses...
JAIR
2006
14 years 9 months ago
2006
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
SMI
1999
IEEE
15 years 1 months ago
1999
IEEE
We discuss how to solve variational constraint problems involving points, lines and planes. We concentrate on small problems that must be solved simultaneously.