Branch and Price for WDM Optical Networks with No Bifurcation of Flow

DOI10.1287/ijoc.1100.0382zbMath1243.90033OpenAlexW2101195427MaRDI QIDQ2899102

Daliborka Stanojević, S. Raghu Raghavan

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/05322bdfbbd9406f3568bbe434a4254f5d14437c

zbMATH Keywords

optical networksmixed-integer programmingmultilayer networkdesign network flows

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (5)

An exact algorithm for an integrated project staffing problem with a homogeneous workforce ⋮ Designing WDM optical networks using branch-and-price ⋮ The invisible‐hand heuristic for origin‐destination integer multicommodity network flows ⋮ Exact Approaches for Network Design Problems with Relays ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut

This page was built for publication: Branch and Price for WDM Optical Networks with No Bifurcation of Flow