An exact method for solving the bi-objective minimum diameter-cost spanning tree problem

DOI10.1051/RO/2014029MaRDI QIDQ5247677zbMATH OpenOpenAlexFDO

Authors Ernando Gomes de Sousa, Andréa Cynthia Santos, Dario José Aloise

Publication date 27 April 2015

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2014029

zbMATH Keywords

multi-objective optimizationparallel partitioning methodspanning trees

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• The problem of the optimal biobjective spanning tree
• Assessing the performance of bi-objective MST for Euclidean and non-Euclidean instances
• On spanning tree problems with multiple objectives
• Evolutionary Multi-Criterion Optimization

Cites work

• K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A survey of recent developments in multiobjective optimization
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• Handbook of multicriteria analysis
• scientific article; zbMATH DE number 1629846 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Minimum Diameter Spanning Trees and Related Problems
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

Cited in

(6)

• An exact solution framework for the minimum cost dominating tree problem
• Assessing the performance of bi-objective MST for Euclidean and non-Euclidean instances
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• On solving bi-objective constrained minimum spanning tree problems
• Generalized nash fairness solutions for bi‐objective minimization problems
• Generalized Nash fairness solutions for bi-objective discrete optimization: theory and algorithms

This page was built for publication: An exact method for solving the bi-objective minimum diameter-cost spanning tree problem

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