On the enumeration of non-dominated spanning trees with imprecise weights

DOI10.1007/978-3-031-45608-4_26MaRDI QIDQ6587937

David Savourey, Tom Davot, Sebastien Destercke

Publication date: 15 August 2024

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Constrained optimization problems under uncertainty with coherent lower previsions
• A branch and bound algorithm for the robust spanning tree problem with interval data
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• On the complexity of the robust spanning tree problem with interval data
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems
• The robust spanning tree problem with interval data
• Distributionally robust possibilistic optimization problems
• On modelling and solving the shortest path problem with evidential weights

Related Items (1)

On the enumeration of non-dominated matroids with imprecise weights

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