Sciweavers

9810 search results - page 235 / 1962
» Problems, Descriptions and Objects
Sort
View
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 12 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
HAIS
2009
Springer
15 years 10 months ago
A Vehicle Routing Problem Solved by Agents
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
Maria Belén Vaquerizo García
EOR
2007
113views more  EOR 2007»
15 years 5 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
CEC
2007
IEEE
16 years 3 days ago
Solving multimodal problems via multiobjective techniques with Application to phase equilibrium detection
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
Mike Preuss, Günter Rudolph, Feelly Tumakaka
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 12 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean