On the complexity of a bundle pricing problem (Q657580): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10288-011-0154-z / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57338952 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-011-0154-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168139487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing bridges to cross a river / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination Can Be Hard: Approximability of the Unique Coverage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal pricing of capacitated networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bundle pricing with monotonicity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Highway Pricing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10288-011-0154-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:04, 10 December 2024

scientific article
Language Label Description Also known as
English
On the complexity of a bundle pricing problem
scientific article

    Statements

    On the complexity of a bundle pricing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2012
    0 references
    pricing problems
    0 references
    computational complexity
    0 references
    approximation algorithm
    0 references

    Identifiers