Sciweavers

9572 search results - page 47 / 1915
» Cover Algorithms and Their Combination
Sort
View
EOR
2006
80views more  EOR 2006»
13 years 10 months ago
Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post
This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-ci...
B. L. Hollis, M. A. Forbes, B. E. Douglas
AAAI
2008
14 years 8 days ago
Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
Hai Leong Chieu, Wee Sun Lee
AMAI
2000
Springer
14 years 1 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 10 months ago
Mining Top-k Covering Rule Groups for Gene Expression Data
In this paper, we propose a novel algorithm to discover the topk covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets...
Gao Cong, Kian-Lee Tan, Anthony K. H. Tung, Xin Xu
WG
2007
Springer
14 years 4 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey