4 search results - page 1 / 1 » Discrete Particle Swarm Optimization for the minimum labelli... |
NC
2010
13 years 3 months ago
2010
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...