A GRASP algorithm for the multi-criteria minimum spanning tree problem
From MaRDI portal
Publication:940883
DOI10.1007/S10479-007-0263-4zbMATH Open1155.90446OpenAlexW2130651948MaRDI QIDQ940883FDOQ940883
Authors: José Elias Claudio Arroyo, Pedro Vieira, Dalessandro Soares Vianna 
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0263-4
Recommendations
- An improved algorithm to solve the multi-criteria minimum spanning tree problem
- A new approach for the multiobjective minimum spanning tree
- On spanning tree problems with multiple objectives
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
- The multi-criteria minimum spanning tree problem based genetic algorithm
Cites Work
- Optimization by simulated annealing
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Greedy randomized adaptive search procedures
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- On spanning tree problems with multiple objectives
- Title not available (Why is that?)
- An annotated bibliography of GRASP – Part I: Algorithms
- The problem of the optimal biobjective spanning tree
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- A partial enumeration heuristic for multi-objective flowshop scheduling problems
Cited In (20)
- The multi-criteria minimum spanning tree problem based genetic algorithm
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
- Multi-objective matroid optimization with ordinal weights
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + GRASP approach
- Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
- A multi-objective GRASP procedure for reactive power compensation planning
- Empirical study of exact algorithms for the multi-objective spanning tree
- An improved algorithm to solve the multi-criteria minimum spanning tree problem
- Dynamic and static simulated annealing for solving the multi-objective k-minimum spanning tree problem
- Combinatorial optimization in system configuration design
- A nonmonotone GRASP
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
- On solving bi-objective constrained minimum spanning tree problems
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- Multiobjective GRASP with path relinking
Uses Software
This page was built for publication: A GRASP algorithm for the multi-criteria minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q940883)
