Pages that link to "Item:Q2385479"

The following pages link to Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479):

Displaying 15 items.

• The inverse parallel machine scheduling problem with minimum total completion time (Q380601) (← links)
• Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
• Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← 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)
• 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)
• Inverse optimization problems with multiple weight functions (Q2112661) (← links)
• Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← links)
• The minmax regret inverse maximum weight problem (Q2243298) (← links)
• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance (Q3225072) (← links)
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)
• Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm (Q6582067) (← links)