On the Approximate Linear Programming Approach for Network Revenue Management Problems (Q2967618): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165356874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Bid Prices in Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network revenue management with inventory-sensitive bid prices and customer choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Bid-Price Controls for Network Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Linear Programming Method for Computing Network Bid Prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management / rank
 
Normal rank

Latest revision as of 11:43, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Approximate Linear Programming Approach for Network Revenue Management Problems
scientific article

    Statements

    On the Approximate Linear Programming Approach for Network Revenue Management Problems (English)
    0 references
    0 references
    0 references
    1 March 2017
    0 references
    dynamic programming optimal control
    0 references
    applications
    0 references
    transportation
    0 references
    air
    0 references
    revenue management
    0 references
    approximate dynamic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references