Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT) for all S, T in N. Such a function is called submodular. We considerâ€¦ (More)

We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods i e implicit pricing of nonbasic variables to generate new columns or toâ€¦ (More)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions ofâ€¦ (More)

We study several ways of obtaining valid inequalities for mixed integer programs. We show how inequalities obtained from a disjunctive argument can be represented by superadditive functions and weâ€¦ (More)

We investigate strong inequalities for mixed 0-1 integer programs derived from flow cover inequalities. Flow cover inequalities are usually not facet defining and need to be lifted to obtain strongerâ€¦ (More)