1054 search results - page 92 / 211 » Capacitated Domination Problem |
112
click to vote
TEC
2008
15 years 2 months ago
2008
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for ...
131
click to vote
WG
2009
Springer
15 years 9 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
121
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
123
click to vote
ICTAC
2004
Springer
15 years 8 months ago
2004
Springer
Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...
108
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...