4843 search results - page 274 / 969 » The Shortcut Problem - Complexity and Approximation |
145
Voted
AUSAI
2009
Springer
15 years 7 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
132
Voted
CCCG
2007
15 years 5 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
130
Voted
IPCO
2010
15 years 5 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
122
Voted
IPL
2008
15 years 3 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
110
Voted
MOC
2002
15 years 3 months ago
2002
An essential part of any boundary value problem is the domain on which the problem is defined. The domain is often given by scanning or another digital image technique with limited...