It shows how they can be modelled by combinatorial optimization problems and how bounds for the combinatorial optimization problems can be computed by polyhedral methods. The thesis provides as well an introduction to the study of polytopes related to partially ordered sets.
Lagrangean approaches lead to the study of special matching problems on bipartite graphs.
The MMM Project , Proceedings of the Third International Society for Decision Support Systems Conference, Hong Kong, 1995. Poster presented at the Third International World-Wide Web Conference, Darmstadt, Germany, April 1995. Proceedings of the First Conference of the Association of Information Systems, Pittsburgh, August 1995. Proceedings of the 5th Workshop on Information Technology and Systems in Nijenrode, The Netherlands, December 1995. Berlin Internet Economics Workshop, October 1997.