Exact Approaches for Network Design Problems with Relays

DOI10.1287/ijoc.2018.0820zbMath1448.90026OpenAlexW2911073210WikidataQ62048254 ScholiaQ62048254MaRDI QIDQ5137444

Martin Georg Riedler, Mario Ruthmair, Markus Leitner, Ivana Ljubić

Publication date: 2 December 2020

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

Full work available at URL: https://semanticscholar.org/paper/0d5671820b6caf98df5c7b90147ba2d4a85d02d3

zbMATH Keywords

integer programmingtelecommunicationsbranch-and-pricenetwork design with relays

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items

Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks

Uses Software

• SCIP
• Boost

Cites Work

• A note on two problems in connexion with graphs
• A branch and price approach for routing and refueling station location model
• Minimum cost path problems with relays
• The network design problem with relays
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• Branch-and-price approaches for the network design problem with relays
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Branch and Price for WDM Optical Networks with No Bifurcation of Flow
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• The regenerator location problem
• The Generalized Regenerator Location Problem
• Regenerator Location Problem in Flexible Optical Networks
• Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
• On implementing push-relabel method for the maximum flow problem

This page was built for publication: Exact Approaches for Network Design Problems with Relays