Polynomial traffic demand polytope partitioning

MaRDI QIDQ2861541zbMATH OpenFDO

Authors Walid Ben-Ameur, Mateusz Żotkiewicz

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001423

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)

Recommendations

• Robust routing and optimal partitioning of a traffic demand polytope
• Routing of uncertain traffic demands
• A Polynomial Time Algorithm for Shaped Partition Problems
• An adaptive algorithm for vector partitioning
• Vertex characterization of partition polytopes of bipartitions and of planar point sets

Cites work

• Designing Least-Cost Nonblocking Broadband Networks
• Robust discrete optimization and its applications
• Routing of uncertain traffic demands

Cited in

(2)

• Robust routing and optimal partitioning of a traffic demand polytope
• Robust delay-constrained routing in telecommunications

This page was built for publication: Polynomial traffic demand polytope partitioning

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