Pages that link to "Item:Q1184348"
From MaRDI portal
The following pages link to Finding minimum-cost flows by double scaling (Q1184348):
Displayed 16 items.
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- A double scaling algorithm for the constrained maximum flow problem (Q941539) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- Executability of scenarios in Petri nets (Q1006647) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
- Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
- A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA (Q3005953) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)