Branch and price for WDM optical networks with no bifurcation of flow
DOI10.1287/IJOC.1100.0382zbMATH Open1243.90033OpenAlexW2101195427MaRDI QIDQ2899102FDOQ2899102
Authors: Daliborka Stanojević, S. 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
Recommendations
- Designing WDM optical networks using branch-and-price
- Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
- Near optimal design of wavelength routed optical networks
- A note on optical network with nonsplitting nodes
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Algorithms – ESA 2004
- Path decomposition under a new cost measure with applications to optical network design
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)
Cited In (9)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- Design techniques of two-layer architectures for WDM optical networks
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce
- Designing WDM optical networks using branch-and-price
- Title not available (Why is that?)
- Exact approaches for network design problems with relays
- Reformulation and decomposition approaches for traffic routing in optical networks
- On the design of optical OFDM-based networks
This page was built for publication: Branch and price for WDM optical networks with no bifurcation of flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899102)
