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

DOI10.1007/S10898-013-0124-4MaRDI QIDQ486390zbMATH OpenOpenAlexFDO

Authors 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

spanning treestransportationnetwork designmultiflow formulationmulti-objective metaheuristics

Mathematics Subject Classification ID

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

Recommendations

• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
• On solving bi-objective constrained minimum spanning tree problems
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• Two‐phase strategies for the bi‐objective minimum spanning tree problem
• The problem of the optimal biobjective spanning tree
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
• Approximating the degree-bounded minimum diameter spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2046100 (Why is no real title available?)
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• A distributed algorithm for constructing a minimum diameter spanning tree
• 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
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• Evolutionary Multi-Criterion Optimization
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• Handbook of multicriteria analysis
• Introduction to algorithms.
• Minimum Diameter Spanning Trees and Related Problems
• Minimum spanning trees made easier via multi-objective optimization
• Modelling the hop constrained connected facility location problem on layered graphs
• Network design for time‐constrained delivery
• 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
• On the minimum diameter spanning tree problem
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• The problem of the optimal biobjective spanning tree

Cited in

(6)

• Geometric minimum diameter minimum cost spanning tree problem
• Assessing the performance of bi-objective MST for Euclidean and non-Euclidean instances
• An exact approach for the minimum-cost bounded-error calibration tree problem
• On solving bi-objective constrained minimum spanning tree problems
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem

This page was built for publication: Modeling and 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 Q486390)