Linear and Combinatorial Sharing Problems

Zimmermann, Uwe (1986) Linear and Combinatorial Sharing Problems.
Published in: Discrete applied mathematics Vol. 15 (1). pp. 85-104.

Abstract

Sharing problems are minimax problems with separable objective, i.e. min {F(x) | x in P} where F(x) := max {fi(xi) | j=1,...,n}. For quasiconvex and lower semicontinuous functions fi on arbitrary totally ordered sets, we derive a duality theory. In particular, a general dual method is shown to apply to linear, combinatorial and convex sharing problems. For linear and bottleneck share functions fi the method is polynomially bounded in many applications.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr84-003
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 25 Oct 2011 12:53
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/3