loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 International Symposium on Applications and the Internet
Integer Programming Approaches to the Problem of Network Upgrading
July 28-August 01
ISBN: 978-0-7695-3297-4
ASCII Text
x 
 
Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki, "Integer Programming Approaches to the Problem of Network Upgrading," Applications and the Internet, IEEE/IPSJ International Symposium on, pp. 229-232, 2008 International Symposium on Applications and the Internet, 2008.
 
 
BibTex
x
 
@article{ 10.1109/SAINT.2008.16,
author = {Toshihide Ibaraki and Toshihide Nomura and Masahiro Sasaki},
title = {Integer Programming Approaches to the Problem of Network Upgrading},
journal ={Applications and the Internet, IEEE/IPSJ International Symposium on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3297-4},
pages = {229-232},
doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT.2008.16},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Applications and the Internet, IEEE/IPSJ International Symposium on
TI - Integer Programming Approaches to the Problem of Network Upgrading
SN - 978-0-7695-3297-4
SP229
EP232
A1 - Toshihide Ibaraki,
A1 - Toshihide Nomura,
A1 - Masahiro Sasaki,
PY - 2008
KW - network upgrading
KW - integer programming
KW - heuristic algorithm
VL - 0
JA - Applications and the Internet, IEEE/IPSJ International Symposium on
ER -
 
The problem of reducing the diameter of a network by upgrading some nodes (i.e., replacing the routers at such nodes by newer models) is considered. The minimization of the total cost to make thediameter no more than U (a given constant) is known to be NP-hard. We discuss integer programming approaches to this problem; some of them aim to obtain exact solutions, and the last is heuristic. Computational results reveal tremendous differences in various formulations for exact solutions, and a clear computational advantage of the heuristic algorithm.
Index Terms:
network upgrading, integer programming, heuristic algorithm
Citation:
Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki, "Integer Programming Approaches to the Problem of Network Upgrading," saint, pp.229-232, 2008 International Symposium on Applications and the Internet, 2008
Usage of this product signifies your acceptance of the Terms of Use.