On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems

DOI10.1007/978-3-319-23114-3_20zbMath1409.90093OpenAlexW2239197698MaRDI QIDQ3449542

Patrice Perny, Nawal Benabbou

Publication date: 4 November 2015

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23114-3_20

zbMATH Keywords

minimax regretmulticriteria optimizationspanning tree problempossibly optimal solutionscriteria weight elicitation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (4)

Scaling-invariant maximum margin preference learning ⋮ Biobjective optimization problems on matroids with binary costs ⋮ An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information ⋮ Combining local search and elicitation for multi-objective combinatorial optimization

This page was built for publication: On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems