Sciweavers

3 search results - page 1 / 1
» The probabilistic relationship between the assignment and as...
Sort
View
IPCO
1992
115views Optimization» more  IPCO 1992»
13 years 6 months ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
Alan M. Frieze, Richard M. Karp, Bruce A. Reed
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
13 years 9 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim