Pages that link to "Item:Q3829324"
From MaRDI portal
The following pages link to Note on Weintraub’s Minimum-Cost Circulation Algorithm (Q3829324):
Displaying 7 items.
- Maximum utility product pricing models and algorithms based on reservation price (Q535296) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- New polynomial-time cycle-canceling algorithms for minimum-cost flows (Q4509383) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)