Path generation for affine flow thinning

DOI10.1016/J.ENDM.2018.02.010MaRDI QIDQ1742256zbMATH OpenOpenAlexWikidataFDO

Authors Michał Pióro, Ilya Kalesnikau, Michael Poss

Publication date 11 April 2018

Full work available at URL https://doi.org/10.1016/j.endm.2018.02.010

zbMATH Keywords

multicommodity flowspath generationsurvivable networksaffine routinglinear and mixed integer programmingvariable link capacity

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• Optimizing flow thinning protection in multicommodity networks with variable link capacity
• The flow deviation method: An approach to store‐and‐forward communication network design
• Routing of uncertain traffic demands
• Optimal dynamic routing in communication networks with continuous traffic
• scientific article; zbMATH DE number 1283996

Cites work

• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 2150800 (Why is no real title available?)
• Complexity of column generation in network design with path-based survivability mechanisms
• Network flows. Theory, algorithms, and applications.
• Optimizing flow thinning protection in multicommodity networks with variable link capacity

Cited in

(2)

• Optimizing flow thinning protection in multicommodity networks with variable link capacity
• A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity

Describes a project that uses

Uses Software

• SNDlib

This page was built for publication: Path generation for affine flow thinning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742256)