10493 search results - page 134 / 2099 » Dynamic Word Problems |
PDP
2002
IEEE
14 years 29 days ago
2002
IEEE
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
JCAM
2010
13 years 2 months ago
2010
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution...
JUCS
2008
13 years 8 months ago
2008
: The topological pressure of dynamical systems theory is examined from a computability theoretic point of view. It is shown that for sofic shift dynamical systems, the topological...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
INFORMATICALT
2006
13 years 8 months ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...