On the enumeration of non-dominated matroids with imprecise weights

DOI10.1016/j.ijar.2024.109266MaRDI QIDQ6638831

Tuan-Anh Vu, Sebastien Destercke, David Savourey, Tom Davot

Publication date: 14 November 2024

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

enumerationmatroidsoptimisationinterval costs

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Artificial intelligence (68Txx) Mathematical economics (91Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained optimization problems under uncertainty with coherent lower previsions
• A branch and bound algorithm for the robust spanning tree problem with interval data
• On combinatorial optimization problems on matroids with uncertain weights
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• On the complexity of the robust spanning tree problem with interval data
• Independence and port oracles for matroids, with an application to computational learning theory
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Interactive optimization of submodular functions under matroid constraints
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
• Optimal assignments in an ordered set: An application of matroid theory
• The robust spanning tree problem with interval data
• Distributionally robust possibilistic optimization problems
• On modelling and solving the shortest path problem with evidential weights
• On the enumeration of non-dominated spanning trees with imprecise weights

This page was built for publication: On the enumeration of non-dominated matroids with imprecise weights