Pricing commodities (Q627117): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-minded unlimited supply pricing on sparse instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination can be hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank

Latest revision as of 19:43, 3 July 2024

scientific article
Language Label Description Also known as
English
Pricing commodities
scientific article

    Statements

    Pricing commodities (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2011
    0 references
    0 references
    pricing
    0 references
    revenue maximization
    0 references
    combinatorial bidding
    0 references
    unit-demand bidders
    0 references
    single-minded bidders
    0 references
    approximation algorithms
    0 references
    LP rounding
    0 references
    0 references