Showing 1 - 1 of 1
We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem …-nd includes a separation heuristic for the dicut inequalities, and problem specific primal heuristics, branching and pruning rules …
Persistent link: https://www.econbiz.de/10005043458