Deneko Vladimir G.

Vladimir G. Deneko

Information about the author Vladimir G. Deneko will soon be added to the site.
Found 4 papers in total
On the dimension of simple monotonic games
On the dimension of simple monotonic games
2006
We show that the following problem is NP-hard, and hence computationally intractable:...
A comment on consecutive-2-out-of-n systems
A comment on consecutive-2-out-of-n systems
2001
In 1986, Du and Hwang proved that the probability of failure in a cyclic double-loop...
The maximum travelling salesman problem on symmetric Demidenko matrices
The maximum travelling salesman problem on symmetric Demidenko matrices
2000
It is well-known that the Travelling Salesman Problem (TSP) is solvable in polynomial...
Well-solvable special cases of the traveling salesman problem: A survey
Well-solvable special cases of the traveling salesman problem: A survey
1998
The traveling salesman problem belongs to the most basic, most important, and most...
Papers per page: