An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem
From MaRDI portal
Publication:6495397
DOI10.1111/ITOR.13424MaRDI QIDQ6495397
Koorush Ziarati, Amin Eskandari, Alireza Nikseresht
Publication date: 30 April 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
assortment optimizationbi-objective optimizationcustomer satisfactionaugmented \(\varepsilon \)-constraint methodranked-based choice model
Cites Work
- Comparison of multi-objective optimization methodologies for engineering applications
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Discrete choice models based on random walks
- Capacitated assortment and price optimization under the multinomial logit model
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A Markov Chain Approximation to Choice Modeling
- Assortment Optimization Under Variants of the Nested Logit Model
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- The d-Level Nested Logit Model: Assortment and Price Optimization Problems
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Inventory Competition Under Dynamic Consumer Choice
- Revenue Management Under the Markov Chain Choice Model
- 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 Approximability of Assortment Optimization Under Ranking Preferences
This page was built for publication: An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem
