Sciweavers

2244 search results - page 40 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
137
Voted
EOR
2006
57views more  EOR 2006»
15 years 6 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
EOR
2008
106views more  EOR 2008»
15 years 6 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
WSC
2007
15 years 8 months ago
Stochastic trust region gradient-free method (strong): a new response-surface-based algorithm in simulation optimization
Response Surface Methodology (RSM) is a metamodelbased optimization method. Its strategy is to explore small subregions of the parameter space in succession instead of attempting ...
Kuo-Hao Chang, L. Jeff Hong, Hong Wan
159
Voted
ISPD
2009
ACM
126views Hardware» more  ISPD 2009»
16 years 27 days ago
A new algorithm for simultaneous gate sizing and threshold voltage assignment
Gate sizing and threshold voltage (Vt) assignment are popular techniques for circuit timing and power optimization. Existing methods, by and large, are either sensitivity-driven h...
Yifang Liu, Jiang Hu
HEURISTICS
2010
15 years 3 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill