8413 search results - page 196 / 1683 » Ordering Problem Subgoals |
ANOR
2005
13 years 10 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
APIN
2005
13 years 10 months ago
2005
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
DAM
2008
13 years 10 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
CP
2009
Springer
14 years 11 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
CHI
2006
ACM
14 years 11 months ago
2006
ACM
The project fragmentation problem in personal information management occurs when someone who is working on a single project stores and retrieves information items relating to that...