Sciweavers

5331 search results - page 67 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
SIAMJO
2011
14 years 4 months ago
Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization
We present a class of inexact adaptive multilevel trust-region SQP-methods for the efficient solution of optimization problems governed by nonlinear partial differential equations...
J. Carsten Ziems, Stefan Ulbrich
ANOR
2010
102views more  ANOR 2010»
14 years 10 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
DCOSS
2011
Springer
13 years 9 months ago
A distributed information fusion method for localization based on Pareto optimization
—To overcome the limitations of specific positioning techniques for mobile wireless nodes and achieve a high accuracy, the fusion of heterogeneous sensor information is an appea...
Alessio De Angelis, Carlo Fischione
MANSCI
2008
128views more  MANSCI 2008»
14 years 9 months ago
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
Júlíus Atlason, Marina A. Epelman, S...
CEC
2011
IEEE
13 years 9 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon