14739 search results - page 291 / 2948 » An optimization problem on the sphere |
126
click to vote
NCA
2008
IEEE
14 years 11 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
JCO
2007
14 years 11 months ago
2007
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
4OR
2004
14 years 11 months ago
2004
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
HEURISTICS
2002
14 years 11 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
105
click to vote
TRANSCI
2010
14 years 9 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...