Sciweavers

13987 search results - page 170 / 2798
» The Two Guards Problem
Sort
View
152
Voted
SAINT
2008
IEEE
15 years 10 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
114
Voted
CEC
2005
IEEE
15 years 9 months ago
An ant algorithm hyperheuristic for the project presentation scheduling problem
Abstract- Ant algorithms have generated significant research interest within the search/optimisation community in recent years. Hyperheuristic research is concerned with the devel...
Edmund K. Burke, Graham Kendall, Dario Landa Silva...
138
Voted
CIMCA
2005
IEEE
15 years 9 months ago
Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows
Research on the optimization of Vehicle Routing Problem with Time Windows (VRPTW) is a significant investigation area of ant colony system (ACS). This paper proposes an enhanced AC...
Xuan Tan, Xuyao Luo, W. N. Chen, Jun Zhang
106
Voted
FOCS
2005
IEEE
15 years 9 months ago
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
Jon M. Kleinberg
119
Voted
CP
2005
Springer
15 years 9 months ago
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
Chris Houghton, David A. Cohen