Keyword : location problem


Maximum-Cover Source-Location Problems
Kenya SUGIHARA Hiro ITO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Vol. E89-A  No. 5 ; pp. 1370-1377
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graphedge-connectivitylocation problempolynomial-time algorithmNP-hard
 Summary | Full Text:PDF(288.5KB)

Optimal Sink Location Problem for Dynamic Flows in a Tree Network
Satoko MAMADA Kazuhisa MAKINO Satoru FUJISHIGE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A  No. 5 ; pp. 1020-1025
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
dynamic flowslocation problemtree networks
 Summary | Full Text:PDF(300KB)

Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree
Hiroshi NAGAMOCHI Koji MOCHIZUKI Toshihide IBARAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/05/01
Vol. E84-A  No. 5 ; pp. 1135-1143
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
vehicle-schedulingtreealgorithmlocation problem
 Summary | Full Text:PDF(267KB)

A Faster and Flexible Algorithm for a Location Problem on Undirected Flow Networks
Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/04/25
Vol. E83-A  No. 4 ; pp. 704-712
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graphnetwork flowlocation problemnode subsetpolynomial timealgorithm
 Summary | Full Text:PDF(558.8KB)

Covering Problems in the p-Collection Problems
Kaoru WATANABE Masakazu SENGOKU Hiroshi TAMURA Shoji SHINODA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/03/25
Vol. E81-A  No. 3 ; pp. 470-475
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 10th Karuizawa Workshop on Circuits and Systems)
Category: 
Keyword: 
location problemnetwork flowsNP-completeoptimization problem
 Summary | Full Text:PDF(526.4KB)

A New Algorithm forp-Collection Problem on a Tree-Type Flow Network
Shuji TSUKIYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/01/25
Vol. E81-A  No. 1 ; pp. 139-146
Type of Manuscript:  PAPER
Category: Graphs and Networks
Keyword: 
flow networklocation problemp-collection problemdynamic programming
 Summary | Full Text:PDF(606.1KB)

The p-Collection Problem in a Flow Network with Lower Bounds
Kaoru WATANABE Hiroshi TAMURA Keisuke NAKANO Masakazu SENGOKU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Vol. E80-A  No. 4 ; pp. 651-657
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
location problemnetwork flowsNP-completeoptimization problem
 Summary | Full Text:PDF(514.6KB)

The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach
Kaoru WATANABE Hiroshi TAMURA Masakazu SENGOKU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/09/25
Vol. E79-A  No. 9 ; pp. 1495-1503
Type of Manuscript:  PAPER
Category: Graphs and Networks
Keyword: 
location problemflow networkNP-completeoptimization problem
 Summary | Full Text:PDF(738.3KB)