Skip to main navigation
Skip to search
Skip to main content
Maastricht University Home
Support & FAQ
Home
Researchers
Publications
Activities
Press/Media
Prizes
Organisations
Datasets
Projects
Search by expertise, name or affiliation
An overview of Stackelberg pricing in networks
C.P.M. van Hoesel
Quantitative Economics
Research output
:
Working paper / Preprint
›
Working paper
112
Downloads (Pure)
Overview
Fingerprint
Publications
(1)
Fingerprint
Dive into the research topics of 'An overview of Stackelberg pricing in networks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Stackelberg
100%
Pricing Problem
100%
Tariffs
66%
Polynomial Time
33%
Two-level
33%
Upper Level
33%
NP-hardness
33%
Bilinear
33%
Compact Representation
33%
Shortest Path Problem
33%
Natural Model
33%
Underlying Network
33%
Branch-and-bound Algorithm
33%
Bilevel Program
33%
Tariff Setting
33%
Complexity Issues
33%
INIS
algorithms
100%
levels
100%
tariffs
100%
decision making
33%
capacity
33%
polynomials
33%
compacts
33%
hardness
33%
Computer Science
Pricing Problem
100%
Polynomial Time
33%
Compact Representation
33%
Shortest Path Problem
33%
Decision-Making
33%
Branch-and-Bound Algorithm
33%
Underlying Network
33%
Complexity Issue
33%
Mathematics
Polynomial Time
100%
Path Problem
100%
Approximability
100%