Sciweavers

111 search results - page 12 / 23
» The Hamiltonian p-Median Problem
Sort
View
95
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Music algorithm to localize sources with unknown directivity in acoustic imaging
The Multiple Signal Classification (MUSIC) algorithm for acoustic imaging most commonly assumes that all sources have undirectional radiation pattern. We here propose a modifica...
Forooz Shahbazi Avarvand, Andreas Ziehe, Guido Nol...
115
Voted
IJFCS
2007
93views more  IJFCS 2007»
15 years 18 days ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
124
Voted
ICNC
2005
Springer
15 years 6 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
171
Voted
NETWORKS
2010
14 years 11 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
93
Voted
IPL
2002
118views more  IPL 2002»
15 years 11 days ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot