Reductions of non-separable approximate linear programs for network revenue management

DOI10.1016/J.EJOR.2023.01.006MaRDI QIDQ6167751zbMATH OpenOpenAlexFDO

Authors Simon Laumer, Christiane Barz

Publication date 10 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2023.01.006

zbMATH Keywords

reductionsapproximate dynamic programmingnon-separabilitynetwork revenue managementrevenue management

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 2000828 (Why is no real title available?)
• A Price-Directed Approach to Stochastic Inventory/Routing
• A general attraction model and sales-based linear program for network revenue management under customer choice
• A new bid price approach to dynamic resource allocation in network revenue management
• A strong Lagrangian relaxation for general discrete-choice network revenue management
• A unifying approximate dynamic programming model for the economic lot scheduling problem
• An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
• An analysis of bid-price controls for network revenue management
• An approximation algorithm for network revenue management under nonstationary arrivals
• Approximate dynamic programming. Solving the curses of dimensionality
• Computing near-optimal policies in generalized joint replenishment
• Decomposition Principle for Linear Programs
• Dynamic Bid Prices in Revenue Management
• Generalized polynomial approximations in Markovian decision processes
• Network revenue management with inventory-sensitive bid prices and customer choice
• New linear program performance bounds for queueing networks
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• On a piecewise-linear approximation for network revenue management
• On the approximate linear programming approach for network revenue management problems
• Reductions of approximate linear programs for network revenue management
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• Revenue management under the Markov chain choice model
• Revenue management: Research overview and prospects
• SPLINE APPROXIMATIONS TO VALUE FUNCTIONS
• The Linear Programming Approach to Approximate Dynamic Programming
• The theory and practice of revenue management
• Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management

Cited in

(1)

• Reductions of approximate linear programs for network revenue management

This page was built for publication: Reductions of non-separable approximate linear programs for network revenue management

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167751)