Network Design with Non Simultaneous Flows
The problem of finding the minimum total cost edge capacities, such that all demand vectors in a given set are non simultaneously satisfied, is analyzed both for directed and non directed networks. In both cases the optimal solution is shown to be the sum of basic networks with suitable uniform edge capacities that can be obtained with standard shortest path algorithms.
KeywordsNetwork Design Travelling Salesman Problem Directed Network Capacity Expansion Basic Network
Unable to display preview. Download preview PDF.
- (FR).J. FREIDENFELDS: Capacity Expansion, North Holland, 1981.Google Scholar
- (HU).T.C. HU: Combinatorial algorithms, Addison Wesley, 1982.Google Scholar
- (LU).M. LUCERTINI: Bounded rationality in Zong term planning: a linear programming approach, Metroeconomica, 1982.Google Scholar
- (LP1).M. LUCERTINI, G. PALETTA: A class of network design problems with multiple demand: model formulation and an algorithmic approach, Netflow, Pisa, 1983.Google Scholar
- (LP2).M. LUCERTINI, G. PALETTA: Progetto di reti in condizione di domande non simultanee: il caso a singolo bene con due nodi domanda, Tec. Rep. CRAI, 1983.Google Scholar
- (MI).M. MINOUX: Optimum synthesis of a network with nonsimultaneous multicommodity flow requirements, Ann. Dis. Math., Vol. 11, 1981.Google Scholar
- (PS).C. PAPADIMITRIOU, L. STEIGLITZ: Some complexity results for the TSP, 8th ACM-STOC, 1976.Google Scholar
- (RSL).D. ROSENKRANTZ, R. STEARNS, P. LEWIS: An analysis of general heuristics for the TSP, SIAM J. Comp., 1977.Google Scholar