Pages that link to "Item:Q4509383"
From MaRDI portal
The following pages link to New polynomial-time cycle-canceling algorithms for minimum-cost flows (Q4509383):
Displaying 14 items.
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem (Q838183) (← links)
- Scheduling for electricity cost in a smart grid (Q1702731) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← links)
- A novel approach to subgraph selection with multiple weights on arcs (Q2168723) (← links)
- Solving coalitional resource games (Q2269130) (← links)
- Preemptive benchmarking problem: An approach for official statistics in small areas (Q2378486) (← links)
- Combinatorial algorithms for the minimum interval cost flow problem (Q2493698) (← links)
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow (Q2757624) (← links)
- Scheduling for Electricity Cost in Smart Grid (Q2867129) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Finding minimum-cost circulations by canceling negative cycles (Q3474897) (← links)
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (Q5470761) (← links)
