Branch-and-price algorithm for a multicast routing problem

DOI10.1057/PALGRAVE.JORS.2600820zbMATH Open1054.90528OpenAlexW2073804575MaRDI QIDQ3154433

No author found.

Publication date: 13 January 2005

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600820

zbMATH Keywords

communicationsnetworks and graphs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (3)

Unnamed Item ⋮ Optimal multicast route packing ⋮ Branching in branch-and-price: A generic scheme

Recommendations

• Branch-and-price algorithm for the resilient multi-level hop-constrained network design 👍 👎
• A branch-and-price algorithm for the minimum latency problem 👍 👎
• Branch-and-price for a multi-attribute technician routing and scheduling problem 👍 👎
• A branch-and-price algorithm for a routing problem with inbound and outbound requests 👍 👎
• A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem 👍 👎
• Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network 👍 👎
• A branch-and-price algorithm for switch-box routing 👍 👎

This page was built for publication: Branch-and-price algorithm for a multicast routing problem