1614 search results - page 81 / 323 » Breadth-First Heuristic Search |
144
click to vote
HEURISTICS
2002
15 years 3 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
136
click to vote
AI
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
117
Voted
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
113
click to vote
GRAPHICSINTERFACE
1997
15 years 5 months ago
1997
This paper presents a method for generating compact and effective constructive-solid-geometry (CSG) object representations from 2D bitmap representations. The method consists of t...
119
click to vote
COMBINATORICS
1998
15 years 3 months ago
1998
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...