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

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

Authors: Tom Davot, S. Destercke, David Savourey 

Publication date: 15 August 2024

Recommendations

• The robust spanning tree problem with interval data
• An exact method to generate all nondominated spanning trees
• The robust fractional spanning tree problem with interval data
• scientific article; zbMATH DE number 804636
• The problem of the optimal biobjective spanning tree

Mathematics Subject Classification ID

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

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The robust spanning tree problem with interval data
• On the complexity of the robust spanning tree problem with interval data
• A branch and bound algorithm for the robust spanning tree problem with interval data
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• On possibly optimal tradeoffs in multicriteria spanning tree problems
• Constrained optimization problems under uncertainty with coherent lower previsions
• Title not available (Why is that?)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• Distributionally robust possibilistic optimization problems
• On modelling and solving the shortest path problem with evidential weights

Cited In (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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587937)