The following pages link to Cenk Çalışkan (Q531423):
Displaying 6 items.
- A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
- A double scaling algorithm for the constrained maximum flow problem (Q941539) (← links)
- A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
- A computational study of the capacity scaling algorithm for the maximum flow problem (Q1761224) (← links)
- A simple derivation of the optimal solution for the EOQ model for deteriorating items with planned backorders (Q2245831) (← links)
- On a capacity scaling algorithm for the constrained maximum flow problem (Q5191144) (← links)
