Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
From MaRDI portal
Publication:4678128
DOI10.1057/PALGRAVE.JORS.2601479zbMath1088.90542OpenAlexW2145437693MaRDI QIDQ4678128
No author found.
Publication date: 23 May 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601479
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items (2)
Designing WDM optical networks using branch-and-price ⋮ Exact Approaches for Network Design Problems with Relays
This page was built for publication: Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network