Enumerative algorithms for choice-based pricing under capacity constraints
From MaRDI portal
Cites work
- A Lagrangian decomposition scheme for choice-based optimization
- A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
- A multicut outer-approximation approach for competitive facility location under random utilities
- An exact algorithm for the static pricing problem under discrete mixed logit demand
- Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Mixed-logit network pricing
- Multiproduct price optimization and competition under the nested logit model with product-differentiated price sensitivities
- Optimizing Multinomial Logit Profit Functions
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Pricing problems under the nested logit model with a quality consistency constraint
- Simulation-based optimization. Parametric optimization techniques and reinforcement learning
- The Benders decomposition algorithm: a literature review
- The maximum capture problem with random utilities: problem formulation and algorithms
This page was built for publication: Enumerative algorithms for choice-based pricing under capacity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255902)
