4103 search results - page 4 / 821 » Some results on the Collatz problem |
MP
2010
13 years 5 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
IPL
2002
13 years 7 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Semidefinite relaxation (SDR) is a high-performance efficient approach to MIMO detection especially for the BPSK or QPSK constellations. Recently, a number of research endeavors...