We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
We study the lift-and-project procedures of Lov´asz-Schrijver and Sherali-Adams applied to the standard linear programming relaxation of the traveling salesperson problem with tr...
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...