
In this paper we derive new characterizations of the Hamiltonian cycles of a directed graph, and a new LP-relaxation of the Traveling Salesman Problem. Our results are obtained via an embedding of these combinatorial optimization problems in suitably perturbed controlled Markov chains. This embedding lends probabilistic interpretation to many of the quantities of interest, which in turn lead naturally to the introduction of a quadratic entropy-like function.
Lp-Relaxation, Hamiltonian Cycles, Programming involving graphs or networks, directed graph, Hamiltonian cycles, Markov Decision Processes, Long-Run Frequencies, Traveling Salesman, quadratic entropy-like function, Paths and cycles, perturbed controlled Markov chains, Quadratic Entropy
Lp-Relaxation, Hamiltonian Cycles, Programming involving graphs or networks, directed graph, Hamiltonian cycles, Markov Decision Processes, Long-Run Frequencies, Traveling Salesman, quadratic entropy-like function, Paths and cycles, perturbed controlled Markov chains, Quadratic Entropy
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 29 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
