Regenerator location problem in flexible optical networks

DOI10.1287/OPRE.2016.1587zbMATH Open1387.90119OpenAlexW2607392775MaRDI QIDQ4604897FDOQ4604897

Authors: Barış Yıldız, Oya Ekin Karasan 

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

Recommendations

• A new branch-and-cut approach for the generalized regenerator location problem
• The Generalized Regenerator Location Problem
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

zbMATH Keywords

routingbranch-and-priceregenerator locationflexible optical networksmodulation selectionpath-segment formulationrelay location

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Selected Topics in Column Generation
• Branch-and-price: Column generation for solving huge integer programs
• The regenerator location problem
• Finding the K Shortest Loopless Paths in a Network
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• The network design problem with relays
• An Integer Programming Approach to the Bandwidth Packing Problem
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
• A branch and price approach for routing and refueling station location model
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• Improved heuristics for the regenerator location problem
• Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions
• Multicommodity Flows in Ring Networks
• The Generalized Regenerator Location Problem
• A computational improvement for a shortest paths ranking algorithm

Cited In (11)

• A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators
• Branch-and-price approaches for the network design problem with relays
• Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
• Exact approaches for network design problems with relays
• A branch and price approach for routing and refueling station location model
• A learning based algorithm for drone routing
• The Generalized Regenerator Location Problem
• Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

This page was built for publication: Regenerator location problem in flexible optical networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604897)