5316 search results - page 26 / 1064 » Which Search Problems Are Random |
COR
2008
15 years 23 days ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
95
Voted
ALENEX
2001
15 years 2 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
109
Voted
EVOW
2007
Springer
15 years 6 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
109
click to vote
EVOW
2008
Springer
15 years 2 months ago
2008
Springer
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
114
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...