Maximum utility product pricing models and algorithms based on reservation price (Q535296): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Note on Weintraub’s Minimum-Cost Circulation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightening simple mixed-integer sets with guaranteed bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing heuristic for a bilevel pricing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Bundle Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product line selection and pricing under a share-of-surplus choice model. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonparametric Approach to Multiproduct Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4891075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and practice of revenue management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Algorithm to Solve Network Flow Problems with Convex Costs / rank
 
Normal rank

Latest revision as of 01:40, 4 July 2024

scientific article
Language Label Description Also known as
English
Maximum utility product pricing models and algorithms based on reservation price
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references