Exact algorithms for bi-objective ring tree problems with reliability measures

DOI10.1016/j.cor.2018.02.004zbMath1391.90605OpenAlexW2793700498WikidataQ115578052 ScholiaQ115578052MaRDI QIDQ1652601

Alessandro Hill, Silvia Schwarze

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.004

zbMATH Keywords

mathematical programmingtelecommunicationsSteiner treecapacitated ring tree problembi-objective optimizationreliable network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (4)

A branch-and-price algorithm for the ring-tree facility location problem ⋮ Optimal Steiner trees under node and edge privacy conflicts ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ Capacitated ring arborescence problems with profits

Cites Work

• Unnamed Item
• Optimal capacitated ring trees
• Bi-objective bimodal urban road network design using hybrid metaheuristics
• The ring tree facility location problem
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• The biobjective travelling purchaser problem
• Multiple criteria decision analysis. State of the art surveys
• Multi-objective vehicle routing problems
• Towards optimizing the deployment of optical access networks
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem
• A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
• The Capacitated m-Ring-Star Problem
• The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Computational Complexity of Network Reliability Analysis: An Overview
• Bicriteria Network Design Problems
• A bicriterion Steiner tree problem on graph
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

This page was built for publication: Exact algorithms for bi-objective ring tree problems with reliability measures