An approximation algorithm for Stackelberg network pricing (Q5318277): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20074 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2951951756 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4495158 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4495159 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stackelberg scheduling strategies / rank | |||
Normal rank | |||
Latest revision as of 15:32, 10 June 2024
scientific article; zbMATH DE number 2207088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for Stackelberg network pricing |
scientific article; zbMATH DE number 2207088 |
Statements
An approximation algorithm for Stackelberg network pricing (English)
0 references
22 September 2005
0 references
network pricing
0 references
approximation algorithms
0 references
Stackelberg games
0 references
combinatorial optimization
0 references
NP-hard problems
0 references
