Login / Signup
An extended ε $\varepsilon $ -constraint method for a bi-objective assortment optimization problem.
Amin Eskandari
Koorush Ziarati
Alireza Nikseresht
Published in:
Int. Trans. Oper. Res. (2024)
Keyphrases
</>
optimization algorithm
computationally efficient
optimization method
objective function
cost function
dynamic programming
mathematical model
computational complexity
sample size
computational efficiency
benchmark problems
constrained optimization
multiple objectives