25 search results - page 4 / 5 » Neurodynamic programming: a case study of the traveling sale... |
ANTSW
2004
Springer
13 years 10 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
FCS
2006
13 years 6 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
MP
2006
13 years 5 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
IRREGULAR
1997
Springer
13 years 9 months ago
1997
Springer
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...