14649 search results - page 332 / 2930 » Principles of problem solving |
157
click to vote
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. When direct measurement of model parameters is not possible, these need to be inferred indirectly from calibration data. To solve this inverse problem, an algorithm that ...
220
Voted
PDP
2002
IEEE
15 years 11 months ago
2002
IEEE
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
157
Voted
AISB
1995
Springer
15 years 10 months ago
1995
Springer
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
184
click to vote
APIN
2006
15 years 6 months ago
2006
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...