Linear and combinatorial sharing problems

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Linear and combinatorial sharing problems

AbstractWe consider sharing problems, i.e., the minimization of separable objectives ƒ(x) = max{ƒj(xj) | j=1,…,n} on polyhedra from linear and combinatorial optimization. An algebraic approach enables a unifying treatment of quite different ‘share’ functions ƒj as well as of real, rational and integral variables. We develop a dual (threshold) method based on lower bounds from knapsack sharing problems. Finiteness and efficiency is derived for several applications, in particular on submodular flow and matching polyhedra