Sciweavers

2244 search results - page 138 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 10 months ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli
JAL
2008
97views more  JAL 2008»
15 years 6 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
CEC
2011
IEEE
14 years 6 months ago
Effective ranking + speciation = Many-objective optimization
—Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (th...
Mario Garza-Fabre, Gregorio Toscano Pulido, Carlos...
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 6 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
GLOBECOM
2008
IEEE
15 years 6 months ago
Efficient Power-Aware Network Provisioning for All-Optical Multicasting in WDM Mesh Networks
Optimal network provisioning is the process of equipping the network with the devices and resources needed to support all traffic demands while minimizing the network cost. Optical...
Ashraf M. Hamad, Ahmed E. Kamal