Pages that link to "Item:Q3474897"
From MaRDI portal
The following pages link to Finding minimum-cost circulations by canceling negative cycles (Q3474897):
Displayed 22 items.
- A direct barter model for course add/drop process (Q534346) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
- Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- Minimum cost multiflows in undirected networks (Q1337137) (← links)
- A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring (Q5936466) (← links)