14739 search results - page 133 / 2948 » An optimization problem on the sphere |
AISS
2010
14 years 7 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
90
Voted
GECCO
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
82
Voted
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
77
Voted
EOR
2007
14 years 10 months ago
2007
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...