Modeling and solving the bi-objective minimum diameter-cost spanning tree problem

DOI10.1007/s10898-013-0124-4zbMath1312.90084OpenAlexW2055424670MaRDI QIDQ486390

Andréa Cynthia Santos, Diego Rocha Lima, Dario José Aloise

Publication date: 15 January 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0124-4

zbMATH Keywords

transportationnetwork designspanning treesmultiflow formulationmulti-objective metaheuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

On solving bi-objective constrained minimum spanning tree problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum diameter spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• Minimum spanning trees made easier via multi-objective optimization
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• The problem of the optimal biobjective spanning tree
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A distributed algorithm for constructing a minimum diameter spanning tree
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• 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
• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• Minimum Diameter Spanning Trees and Related Problems
• Bicriteria Network Design Problems
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Network design for time‐constrained delivery
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Evolutionary Multi-Criterion Optimization
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: Modeling and solving the bi-objective minimum diameter-cost spanning tree problem