Regenerator Location Problem in Flexible Optical Networks

DOI10.1287/opre.2016.1587zbMath1387.90119OpenAlexW2607392775MaRDI QIDQ4604897

Oya Ekin Karaşan, Barış Yıldız

Publication date: 6 March 2018

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/48541

zbMATH Keywords

branch-and-priceroutingregenerator locationflexible optical networksmodulation selectionpath-segment formulationrelay location

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (5)

A branch and price approach for routing and refueling station location model ⋮ Branch-and-price approaches for the network design problem with relays ⋮ A learning based algorithm for drone routing ⋮ Exact Approaches for Network Design Problems with Relays ⋮ A branch-and-Benders-cut approach for the fault tolerant regenerator location problem

Cites Work

• Unnamed Item
• A branch and price approach for routing and refueling station location model
• The network design problem with relays
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• A computational improvement for a shortest paths ranking algorithm
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• The regenerator location problem
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• The Generalized Regenerator Location Problem
• Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions
• An Integer Programming Approach to the Bandwidth Packing Problem
• Improved heuristics for the regenerator location problem
• Selected Topics in Column Generation
• Finding the K Shortest Loopless Paths in a Network
• Multicommodity Flows in Ring Networks

This page was built for publication: Regenerator Location Problem in Flexible Optical Networks