660 search results - page 92 / 132 » Hybrid CSP Solving |
172
Voted
HEURISTICS
2010
14 years 10 months ago
2010
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
132
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
109
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
136
Voted
KI
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
134
Voted
EOR
2008
15 years 3 months ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...