An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
From MaRDI portal
Publication:5247677
DOI10.1051/ro/2014029zbMath1310.90098OpenAlexW2027592267MaRDI QIDQ5247677
Andréa Cynthia Santos, Dario José Aloise, Ernando Gomes de Sousa
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
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
On solving bi-objective constrained minimum spanning tree problems ⋮ Generalized nash fairness solutions for bi‐objective minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy heuristics for the diameter-constrained minimum spanning tree problem
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A hybrid heuristic for the diameter constrained minimum spanning tree problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- A survey of recent developments in multiobjective optimization
- Handbook of multicriteria analysis
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- Solving diameter-constrained minimum spanning tree problems by constraint programming
- Integer Programming Formulation of Traveling Salesman Problems
- Minimum Diameter Spanning Trees and Related Problems
- Bicriteria Network Design Problems
- 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
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
This page was built for publication: An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
