Sciweavers

14649 search results - page 361 / 2930
» Principles of problem solving
Sort
View
ANTSW
2006
Springer
15 years 10 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
GECCO
2006
Springer
15 years 10 months ago
MOGE: GP classification problem decomposition using multi-objective optimization
A novel approach to classification is proposed in which a Paretobased ranking of individuals is used to encourage multiple individuals to participate in the solution. To do so, th...
Andrew R. McIntyre, Malcolm I. Heywood
CCCG
2008
15 years 8 months ago
Application of computational geometry to network p-center location problems
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Qiaosheng Shi, Binay K. Bhattacharya
IPCO
2007
94views Optimization» more  IPCO 2007»
15 years 8 months ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
CATA
2004
15 years 8 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares