Sciweavers

2126 search results - page 39 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
IOR
2008
109views more  IOR 2008»
14 years 9 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
14 years 10 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper
CASC
2010
Springer
151views Mathematics» more  CASC 2010»
14 years 8 months ago
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods t...
Winfried Neun, Thomas Sturm, Stefan Vigerske
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
14 years 11 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
15 years 3 months ago
Fitness-based neighbor selection for multimodal function optimization
We propose a selection scheme called Fitness-based Neighbor Selection (FNS) for multimodal optimization. The FNS is aimed for ill-scaled and locally multimodal domain, both found ...
Shin Ando, Shigenobu Kobayashi