Pages that link to "Item:Q686416"

The following pages link to A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416):

Displaying 11 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
• Critical objective function values in linear sum assignment problems (Q1743488) (← links)
• Sensitivity analysis of the optimal assignment. (Q1811143) (← links)
• Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
• A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform (Q2094840) (← links)
• Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies (Q2476755) (← links)
• A graph space optimal transport distance as a generalization of <i>L</i> ^<i>p</i> distances: application to a seis (Q5228010) (← links)