Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...