4 search results - page 1 / 1 » Discrete Particle Swarm Optimization for the minimum labelli... |
129
Voted
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
174
click to vote
GECCO
2007
Springer
16 years 26 days 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...
184
click to vote
FOCS
2005
IEEE
16 years 9 days 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 ...