Pages that link to "Item:Q3611928"
From MaRDI portal
The following pages link to Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance (Q3611928):
Displaying 10 items.
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129) (← links)
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- The minmax regret inverse maximum weight problem (Q2243298) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance (Q2818313) (← links)
- Efficient Algorithms for the Inverse Spanning-Tree Problem (Q3637389) (← links)
- An algorithm for inverse minimum spanning tree problem (Q4378113) (← links)
