Optimal pricing of capacitated networks


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 specified by a simple path in the network and has a maximum budget that we… (More)
DOI: 10.1002/net.20260


1 Figure or Table

Slides referencing similar topics