Pages that link to "Item:Q5929137"

The following pages link to Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137):

Displaying 9 items.

• The subset assignment problem for data placement in caches (Q724230) (← links)
• The MA-ordering max-flow algorithm is not strongly polynomial for directed networks (Q1433655) (← links)
• Solving MIPs via scaling-based augmentation (Q1662107) (← links)
• On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
• A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746) (← links)
• Improved primal simplex: a more general theoretical framework and an extended experimental analysis (Q2802253) (← links)
• (Q4952722) (← links)
• Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
• On circuit diameter bounds via circuit imbalances (Q6589764) (← links)