liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A multicommodity network-flow problem with side constraints on paths solved by column generation
Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.ORCID iD: 0000-0001-5907-0087
Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
2003 (English)In: INFORMS journal on computing, ISSN 1091-9856, E-ISSN 1526-5528, Vol. 15, no 1, 42-57 p.Article in journal (Refereed) Published
Abstract [en]

The multicommodity network-flow model concerns routing of a number of commodities through a capacitated network at minimal cost. In the basic model, it is assumed that for each commodity, the flow can be routed on any path connecting its origin and its destination. In telecommunication applications, where a commodity represents a communication pair, there are often additional time-delay or reliability requirements on paths that are used for routing. These requirements may vary by communication pair, represented by different priority classes. In this paper, we extend the basic multicommodity network-flow model to include such side constraints on paths. The extended problem is NP-hard with the constrained shortest-path problem as a special case. To solve the extended model, we use a column-generation approach, in which the solution is built up successively by path generation. The side constraints are efficiently handled in the path-generation subproblem. We further discuss various enhancements of this approach. Computational results show that the column-generation approach provides an efficient way for solving the extended model, even for fairly large networks.

Place, publisher, year, edition, pages
2003. Vol. 15, no 1, 42-57 p.
Keyword [en]
Integer Programming: Algorithms, Column Generation, Networks-Graphs: Flow Algorithms, Networks-Graphs: Multicommodity, Side Constraints
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-46408DOI: 10.1287/ijoc.15.1.42.15151OAI: oai:DiVA.org:liu-46408DiVA: diva2:267304
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-12-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Holmberg, KajYuan, Di

Search in DiVA

By author/editor
Holmberg, KajYuan, Di
By organisation
Department of MathematicsThe Institute of Technology
In the same journal
INFORMS journal on computing
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 383 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf