Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures.

Saeid Rasti Yiwen Xu

Published in: Comput. Oper. Res. (2023)

Keyphrases

hamiltonian cycle
minimum cost
network flow problem
traveling salesman problem
network flow
np hard
phase transition
approximation algorithms
spanning tree
graph coloring
undirected graph
generative model
bayesian networks
constraint satisfaction
worst case
supply chain
evolutionary algorithm