Multi-objective matroid optimization with ordinal weights

DOI10.1016/j.dam.2022.07.017zbMath1519.90222arXiv2109.13804OpenAlexW3204440896MaRDI QIDQ6046136

Michael Stiglmayr, Julia Sudhoff, Kathrin Klamroth

Publication date: 15 May 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.13804

zbMATH Keywords

multi-objective combinatorial optimizationmatroid intersectionmulti-objective minimum spanning treeordinal weights

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items

Ordinal optimization through multi-objective reformulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• On spanning tree problems with multiple objectives
• A survey and annotated bibliography of multiobjective combinatorial optimization
• The binary knapsack problem with qualitative levels
• Shortest paths with ordinal weights
• The multi-criteria minimum spanning tree problem based genetic algorithm
• A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
• On matroids with multiple objectives
• Efficient algorithms for a family of matroid intersection problems
• Two algorithms for weighted matroid intersection
• A weighted matroid intersection algorithm
• Multicriteria Optimization
• Matroids and the greedy algorithm