Pages that link to "Item:Q2818313"
From MaRDI portal
The following pages link to Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance (Q2818313):
Displaying 5 items.
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129) (← links)
- A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance (Q3611928) (← links)
