Sciweavers

14161 search results - page 233 / 2833
» On generalized middle-level problem
Sort
View
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
16 years 1 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
ICTAI
2008
IEEE
16 years 28 days ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
HPDC
2007
IEEE
16 years 25 days ago
Smartsockets: solving the connectivity problems in grid computing
Tightly coupled parallel applications are increasingly run in Grid environments. Unfortunately, on many Grid sites the ability of machines to create or accept network connections ...
Jason Maassen, Henri E. Bal
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 20 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
16 years 20 days ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles