14739 search results - page 61 / 2948 » An optimization problem on the sphere |
COCOA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
125
click to vote
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
KES
2007
Springer
15 years 4 months ago
2007
Springer
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
171
click to vote
LSSC
2007
Springer
15 years 4 months ago
2007
Springer
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
WICON
2008
14 years 11 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...