Pages that link to "Item:Q2643813"

The following pages link to Partial inverse assignment problems under \(l_{1}\) norm (Q2643813):

Displaying 12 items.

• Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← 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)
• General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms (Q2082216) (← 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)
• An interior-point algorithm for solving inverse linear optimization problem (Q2903128) (← links)
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)