Paper Info
Title
Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
Abstract
We first introduce a generic model for discrete cost multicommodity network optimization, together with several variants relevant to telecommunication networks such as: the case where discrete node cost functions (accounting for switching equipment) have to be included in the objective; the case where survivability constraints with respect to single-link and/or single-node failure have to be taken into account. An overview of existing exact solution methods is presented, both for special cases (such as the so-called single-facility and two-facility network loading problems) and for the general case where arbitrary step-increasing link cost-functions are considered. The basic discrete cost multicommodity flow problem (DCMCF) as well as its variant with survivability constraints (DCSMCF) are addressed. Several possible directions for improvement or future investigations are mentioned in the concluding section.
Year
DOI
Venue
2001
10.1023/A:1014554606793
Annals OR
Keywords
Field
DocType
Exact Solution,Cost Function,Generic Model,Solution Method,Flow Problem
Exact solutions in general relativity,Mathematical optimization,Survivability,Computer science,Multi-commodity flow problem,Optimization problem
Journal
Volume
Issue
ISSN
106
1-4
1572-9338
Citations 
PageRank 
References 
20
1.01
21
Authors
1
Name
Order
Citations
PageRank
Michel Minoux1741100.18