F. Clautiaux

An Efficient Solver for Integral Flows in Decision Hypergraphs with Applications to Orthogonal Knapsack Problems

A generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs, is proposed, which outperforms the best algorithm known thus far and is the first to close the optimality gap for all instances of several well-known benchmarks.