186 search results - page 22 / 38 » Exceptional planar polynomials |
DISOPT
2010
13 years 7 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
IJBC
2006
13 years 7 months ago
2006
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
ALGORITHMICA
2004
13 years 7 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
ROBOTICA
2002
2002
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
13 years 7 months ago
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
MOR
2010
13 years 6 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....