Pages that link to "Item:Q1685587"

The following pages link to Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587):

Displaying 13 items.

• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
• The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2022333) (← links)
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
• Constrained inverse minimum flow problems under the weighted Hamming distance (Q2049978) (← 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)
• Inverse optimization problems with multiple weight functions (Q2112661) (← links)
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
• Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← 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)