111 search results - page 5 / 23 » The Hamiltonian p-Median Problem |
JSYML
2010
13 years 5 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
EUROCAST
2009
Springer
14 years 2 months ago
2009
Springer
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
SARA
2009
Springer
14 years 5 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...
AUTOMATICA
2005
13 years 10 months ago
2005
To apply time-varying port-controlled Hamiltonian (PCH) systems to practical control designs, two basic problems should be dealt with: one is how to provide such time-varying syst...
GECCO
2003
Springer
14 years 4 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...