A branch-and-cut approach for minimum cost multi-level network design

Authors:
Sunil Chopra;Chih-Yang Tsai
Affiliations:
-;-
Venue:
Discrete Mathematics
Year:
2002

Citing 0
Cited 3

Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
4/R/I/T distribution logistics network 0-1 programming model and application

Computers and Industrial Engineering
Optimal design of hierarchical networks with free main path extremes

Operations Research Letters

Quantified Score

Hi-index	0.05

Visualization

Abstract