Pages that link to "Item:Q992575"

The following pages link to Inverse minimum cost flow problems under the weighted Hamming distance (Q992575):

Displaying 8 items.

• Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493) (← links)
• The inverse parallel machine scheduling problem with minimum total completion time (Q380601) (← 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)
• Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
• Inverse generalized minimum cost flow problem under the Hamming distances (Q2314066) (← links)
• Note on ``Inverse minimum cost flow problems under the weighted Hamming distance'' (Q2514798) (← links)
• Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks (Q5013391) (← links)