Heuristic Techniques for Solving Large Combinatorial Problems on a Computer

摘要: Many problems of optimization, search, or decision-making are combinatorial in nature and basically non-numerical. The advent the modern high-speed digital computer has opened way for us to solve many these problems. Although virtually all finite, it is well-known that their size grows extremely rapidly we can usually expect do by exhaustive search just a few cases larger than what be done hand. Intelligent procedures such as banach bound (Little, Murty, Sweeney Karel (1963), Lawles Wood (1964)), back-track programming (Golomb Baument (1965), Walker (1960)), linear dynamic (Gomery Bellman (1962), Held Karp (1962)), together with isomorphic rejection (Swift, 1960) help reduce total number considered but more often not, interested solution which still too large techniques. Here some sort heuristics have employed, whereby hope (in instance where when found may readily verified), probably solution, useful partial approximate obtained reasonable computation time.