Optimal pricing of capacitated networks

DOI10.1002/net.20260zbMath1176.90069OpenAlexW4245393945WikidataQ57338957 ScholiaQ57338957MaRDI QIDQ5191131

Alexander Grigoriev, Marc Uetz, Joyce van Loon, R. A. Sitters

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20260

zbMATH Keywords

computational complexitydynamic programmingapproximation algorithmsnetwork pricinghighway problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Related Items

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ On the complexity of a bundle pricing problem ⋮ Price strategy implementation ⋮ Models and algorithms for the product pricing with single-minded customers requesting bundles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Decomposition by clique separators
• Competitive auctions
• Computationally Manageable Combinational Auctions
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Combination can be hard
• Single-minded unlimited supply pricing on sparse instances
• Stability in circular arc graphs
• Maximum matching and a polyhedron with 0,1-vertices