On the bicriterion - minimal cost/minimal label - spanning tree problem

DOI10.1016/j.ejor.2009.10.013zbMath1178.90052OpenAlexW2083945885MaRDI QIDQ2655606

Marta M. B. Pascoal, Maria Eugénia Captivo, Joao Carlos Namorado Climaco

Publication date: 25 January 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.10.013

zbMATH Keywords

spanning treeminimal costmulti-objective decision makingminimal label

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Related Items (7)

On the tractability of shortest path problems in weighted edge-coloured graphs ⋮ Bicriteria path problem minimizing the cost and minimizing the number of labels ⋮ Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort ⋮ Biobjective optimization problems on matroids with binary costs ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Dynamic programming for spanning tree problems: application to the multi-objective case ⋮ Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A mixed integer linear formulation for the minimum label spanning tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• A bicriterion shortest path algorithm
• On bicriterion minimal spanning trees: An approximation
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• A note on the minimum label spanning tree.
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
• The multi-criteria minimum spanning tree problem based genetic algorithm
• An Algorithm for Finding K Minimum Spanning Trees
• Efficiency of a Good But Not Linear Set Union Algorithm
• Two Algorithms for Generating Weighted Spanning Trees in Order
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

This page was built for publication: On the bicriterion - minimal cost/minimal label - spanning tree problem