# Computational complexity of integrated models of network design and facility location.

Bhadury, J.; Chandrasekharan, R.; Gewali, L.

Southwest Journal of Pure and Applied Mathematics [electronic only] (2000)

- Volume: 2000, Issue: 1, page 30-43
- ISSN: 1083-0464

## Access Full Article

top## How to cite

topBhadury, J., Chandrasekharan, R., and Gewali, L.. "Computational complexity of integrated models of network design and facility location.." Southwest Journal of Pure and Applied Mathematics [electronic only] 2000.1 (2000): 30-43. <http://eudml.org/doc/223784>.

@article{Bhadury2000,

author = {Bhadury, J., Chandrasekharan, R., Gewali, L.},

journal = {Southwest Journal of Pure and Applied Mathematics [electronic only]},

keywords = {location theory; transportation networks; constrained minimal spanning tree problem; NP complete},

language = {eng},

number = {1},

pages = {30-43},

publisher = {Cameron University, Lawton},

title = {Computational complexity of integrated models of network design and facility location.},

url = {http://eudml.org/doc/223784},

volume = {2000},

year = {2000},

}

TY - JOUR

AU - Bhadury, J.

AU - Chandrasekharan, R.

AU - Gewali, L.

TI - Computational complexity of integrated models of network design and facility location.

JO - Southwest Journal of Pure and Applied Mathematics [electronic only]

PY - 2000

PB - Cameron University, Lawton

VL - 2000

IS - 1

SP - 30

EP - 43

LA - eng

KW - location theory; transportation networks; constrained minimal spanning tree problem; NP complete

UR - http://eudml.org/doc/223784

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.