1603 search results - page 1 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
SIAMJO
2008
13 years 4 months ago
2008
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
JOTA
2010
12 years 11 months ago
2010
Abstract. In this paper the Pareto solution set of a piecewise linear multiobjective optimization problem in a normed space is shown to be a union of finitely many semiclosed polyh...
KES
2008
Springer
13 years 5 months ago
2008
Springer
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
ICTAI
2009
IEEE
13 years 2 months ago
2009
IEEE
This paper describes a noise-aware dominance operator for evolutionary algorithms to solve the multiobjective optimization problems (MOPs) that contain noise in their objective fu...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...