An extended -constraint method for a bi-objective assortment optimization problem
From MaRDI portal
(Redirected from An extended -constraint method for a bi-objective assortment optimization problem)
An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem
An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem
Cites work
- A Markov chain approximation to choice modeling
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Assortment optimization under variants of the nested logit model
- Capacitated assortment and price optimization under the multinomial logit model
- Comparison of multi-objective optimization methodologies for engineering applications
- Discrete choice models based on random walks
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Inventory Competition Under Dynamic Consumer Choice
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Revenue management under the Markov chain choice model
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Technical note: An expectation-maximization algorithm to estimate the parameters of the Markov chain choice model
- Technical note: Assortment optimization with small consideration sets
- The d-level nested logit model: assortment and price optimization problems
- The approximability of assortment optimization under ranking preferences
Cited in
(3)
This page was built for publication: An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495397)