285 search results - page 17 / 57 » Intelligent Neighborhood Exploration in Local Search Heurist... |
EVOW
2007
Springer
15 years 6 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
97
Voted
AAAI
2006
15 years 1 months ago
2006
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
CP
2005
Springer
15 years 6 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
94
Voted
TRANSCI
2008
15 years 10 days ago
2008
The availability of relatively cheap small jet aircrafts suggests a new air transportation business: dial-a-flight, an on-demand service in which travelers call a few days in adva...
119
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Time...