Sciweavers

1603 search results - page 38 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
WSC
1998
14 years 11 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill
CEC
2010
IEEE
14 years 6 months ago
Novel multimodal problems and differential evolution with ensemble of restricted tournament selection
Multi-modal optimization refers to locating not only one optimum but a set of locally optimal solutions. Niching is an important technique to solve multi-modal optimization problem...
Bo-Yang Qu, Ponnuthurai Nagaratnam Suganthan
SPAA
2005
ACM
15 years 3 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 2 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
COR
2011
14 years 5 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria