Branch-and-price approaches for the network design problem with relays
From MaRDI portal
Publication:1651598
DOI10.1016/j.cor.2018.01.004zbMath1391.90624OpenAlexW2781602595MaRDI QIDQ1651598
Barış Yıldız, Oya Ekin Karaşan, Hande Yaman
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/8191
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items (2)
A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Exact Approaches for Network Design Problems with Relays
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and price approach for routing and refueling station location model
- Minimum cost path problems with relays
- The network design problem with relays
- The Steiner tree problem
- The Steiner tree problem with hop constraints
- Integer programming formulations of discrete hub location problems
- A computational improvement for a shortest paths ranking algorithm
- Infrastructure development for conversion to environmentally friendly fuel
- Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
- The regenerator location problem
- The Generalized Regenerator Location Problem
- The node-weighted steiner tree problem
- Regenerator Location Problem in Flexible Optical Networks
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Selected Topics in Column Generation
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem
This page was built for publication: Branch-and-price approaches for the network design problem with relays
