Sciweavers

17 search results - page 2 / 4
» Heuristic and Exact Methods for the Discrete (r |p)-Centroid...
Sort
View
ENDM
2010
167views more  ENDM 2010»
13 years 3 months ago
Column Generation based Primal Heuristics
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, Fr...
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
13 years 10 months ago
Adaptive discretization for probabilistic model building genetic algorithms
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
14 years 26 days ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...
COCOA
2009
Springer
13 years 10 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
13 years 4 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...