Pages that link to "Item:Q885822"

The following pages link to Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (Q885822):

Displaying 16 items.

• Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
• Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493) (← links)
• Inverse minimum cost flow problems under the weighted Hamming distance (Q992575) (← links)
• Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
• A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
• Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
• Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
• Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
• Constrained inverse minimum flow problems under the weighted Hamming distance (Q2049978) (← links)
• Partial inverse maximum spanning tree problem under the Chebyshev norm (Q2091101) (← links)
• Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm (Q2150566) (← 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)
• The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)