Sciweavers

882 search results - page 98 / 177
» On the Application of Evolutionary Algorithms to the Consens...
Sort
View
INFORMS
2006
87views more  INFORMS 2006»
13 years 8 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
EMO
2009
Springer
140views Optimization» more  EMO 2009»
14 years 20 days ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
GECCO
2010
Springer
244views Optimization» more  GECCO 2010»
13 years 8 months ago
Implicit fitness and heterogeneous preferences in the genetic algorithm
This paper takes an economic approach to derive an evolutionary learning model based entirely on the endogenous employment of genetic operators in the service of self-interested a...
Justin T. H. Smith
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
13 years 11 months ago
Emergent mating topologies in spatially structured genetic algorithms
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
Joshua L. Payne, Margaret J. Eppstein