Pages that link to "Item:Q2385466"

The following pages link to The shortest path improvement problems under Hamming distance (Q2385466):

Displaying 16 items.

• The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← links)
• A selfish routing based network improvement problem (Q545450) (← links)
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916) (← links)
• The center location improvement problem under the Hamming distance (Q1781802) (← links)
• Algorithms for the shortest path improvement problems under unit Hamming distance (Q1791343) (← links)
• Expanding maximum capacity path under weighted sum-type distances (Q2144881) (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
• Capacity inverse minimum cost flow problem (Q2268762) (← links)
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
• (Q2754134) (← links)
• Increasing distances in graphs (Q2786336) (← links)
• (Q3644697) (← links)
• Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
• Efficient algorithms for the reverse shortest path problem on trees under the hamming distance (Q4987673) (← links)
• Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)