Summary: Optimal Pricing of Capacitated Networks
Alexander Grigoriev 1
, Joyce van Loon 1
, Ren´e Sitters2
, and Marc Uetz3
1
Maastricht University, Quantitative Economics,
P.O.Box 616, NL­6200 MD Maastricht, The Netherlands
{a.grigoriev,j.vanloon}@ke.unimaas.nl
2
Eindhoven University of Technology, Mathematics and Computer Science,
P.O. Box 513, NL­5600 MB Eindhoven, The Netherlands
r.sitters@tue.nl
3
University of Twente, Applied Mathematics,
P.O. Box 217, NL­7500 AE Enschede, The Netherlands
m.uetz@utwente.nl
Abstract. We address the algorithmic complexity of a profit maximization problem in capacitated,
undirected networks. We are asked to price a set of m capacitated network links to serve a set of
n potential customers. Each customer is interested in purchasing a network connection that is

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

Collections: Engineering