Optimality conditions in preference-based spanning tree problems

DOI10.1016/j.ejor.2008.07.042zbMath1163.90791OpenAlexW2050279115MaRDI QIDQ1027614

Antonio Sedeño-Noda, Miguel Ángel Domínguez-Ríos, Sergio Alonso, Marcos Colebrook

Publication date: 30 June 2009

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

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

zbMATH Keywords

multiple criteria analysispreference modellingmultiobjective spanning tree problems

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Related Items

Empirical study of exact algorithms for the multi-objective spanning tree ⋮ Shortest paths with ordinal weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A preference-based approach to spanning trees and shortest paths problems
• A polynomial algorithm for the multicriteria cent-dian location problem
• On spanning tree problems with multiple objectives
• The problem of the optimal biobjective spanning tree
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Minimal spanning trees: An empirical investigation of parallel algorithms
• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• On the History of the Minimum Spanning Tree Problem