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

DOI10.1016/J.COR.2018.02.004MaRDI QIDQ1652601zbMATH OpenOpenAlexWikidataFDO

Authors 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 programmingSteiner treecapacitated ring tree problemtelecommunicationsbi-objective optimizationreliable network design

Mathematics Subject Classification ID

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

Recommendations

• Optimal capacitated ring trees
• Efficient optimization of reliable two-node connected networks: a biobjective approach
• The ring tree facility location problem
• Ring network design
• scientific article; zbMATH DE number 1535630

Cites work

• scientific article; zbMATH DE number 1975100 (Why is no real title available?)
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• A bicriterion Steiner tree problem on graph
• A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
• Bi-objective bimodal urban road network design using hybrid metaheuristics
• Computational Complexity of Network Reliability Analysis: An Overview
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• Multi-exchange neighborhoods for the capacitated ring tree problem
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• Multi-objective vehicle routing problems
• Multiple criteria decision analysis. State of the art surveys
• Optimal capacitated ring trees
• The Capacitated m-Ring-Star Problem
• The biobjective travelling purchaser problem
• The multiobjective traveling salesman problem: A survey and a new approach
• The ring tree facility location problem
• Towards optimizing the deployment of optical access networks

Cited in

(7)

• Optimal capacitated ring trees
• On the 2-MRS problem in a tree with unreliable edges
• Capacitated ring arborescence problems with profits
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
• Optimal Steiner trees under node and edge privacy conflicts
• A branch-and-price algorithm for the ring-tree facility location problem
• Efficient optimization of reliable two-node connected networks: a biobjective approach

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

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