Convex Congestion Network Problems

M. Quant, J.H. Reijnierse

Research output: Working paperDiscussion paperOther research output

267 Downloads (Pure)

Abstract

This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is optimal is provided.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages18
Volume2004-59
Publication statusPublished - 2004

Publication series

NameCentER Discussion Paper
Volume2004-59

Keywords

  • game theory
  • cooperative games
  • algorithm

Fingerprint Dive into the research topics of 'Convex Congestion Network Problems'. Together they form a unique fingerprint.

Cite this