Pages that link to "Item:Q486731"
From MaRDI portal
The following pages link to Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731):
Displaying 12 items.
- Post factum analysis for robust multiple criteria ranking and sorting (Q300762) (← links)
- 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 max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- Partial inverse maximum spanning tree problem under the Chebyshev norm (Q2091101) (← links)
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446) (← links)
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)
