Exact algorithms for bi-objective ring tree problems with reliability measures
type: Item
instance of: scholarly article
title: Exact algorithms for bi-objective ring tree problems with reliability measures
zbMATH Open document ID: 1391.90605
author: Alessandro Hill
author: Silvia Schwarze
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 6901581
zbMATH Keywords: capacitated ring tree problem
zbMATH Keywords: bi-objective optimization
zbMATH Keywords: Steiner tree
zbMATH Keywords: reliable network design
zbMATH Keywords: mathematical programming
zbMATH Keywords: telecommunications
MaRDI profile type: Publication
full work available at URL: j.cor.2018.02.004
OpenAlex ID: W2793700498
Wikidata QID: Q115578052
cites work: The Capacitated m-Ring-Star Problem
cites work: Computational Complexity of Network Reliability Analysis: An Overview
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
cites work: Multiple criteria decision analysis. State of the art surveys
cites work: An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
cites work: Towards optimizing the deployment of optical access networks
cites work: A Survey on Multiple Objective Minimum Spanning Tree Problems
cites work: Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem
cites work: Optimal capacitated ring trees
cites work: The ring tree facility location problem
cites work: Multi-objective meta-heuristics for the traveling salesman problem with profits
cites work: Multi-objective vehicle routing problems
cites work: A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
cites work: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
cites work: Metaheuristics and cooperative approaches for the bi-objective ring star problem
cites work: The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
cites work: Bicriteria Network Design Problems
cites work: Bi-objective bimodal urban road network design using hybrid metaheuristics
cites work: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
cites work: Q4424321
cites work: The biobjective travelling purchaser problem
cites work: A bicriterion Steiner tree problem on graph
DOI: 10.1016/J.COR.2018.02.004
description: scientific article; zbMATH DE number 6901581