Pages that link to "Item:Q1373741"

The following pages link to A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741):

Displaying 12 items.

• Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
• A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• A least-squares minimum-cost network flow algorithm (Q646641) (← links)
• An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
• (Q5009421) (← links)
• (Q5111641) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)
• Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)
• Budget-feasible mechanisms for proportionally selecting agents from groups (Q6080647) (← links)
• Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)