scientific article

zbMath1274.90073MaRDI QIDQ2861541

Walid Ben-Ameur, Mateusz Żotkiewicz

Publication date: 8 November 2013

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (1)

Robust delay-constrained routing in telecommunications

Cites Work

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

This page was built for publication: