An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem (Q6495397): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Approximability of Assortment Optimization Under Ranking Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete choice models based on random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Markov Chain Approximation to Choice Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of multi-objective optimization methodologies for engineering applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assortment Optimization Under Variants of the Nested Logit Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Assortment Optimization with Small Consideration Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management Under the Markov Chain Choice Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>d</i>-Level Nested Logit Model: Assortment and Price Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inventory Competition Under Dynamic Consumer Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stocking Retail Assortments Under Dynamic Consumer Substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management Under a General Discrete Choice Model of Consumer Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated assortment and price optimization under the multinomial logit model / rank
 
Normal rank

Revision as of 14:35, 3 December 2024

scientific article; zbMATH DE number 7841039
Language Label Description Also known as
English
An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem
scientific article; zbMATH DE number 7841039

    Statements

    An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2024
    0 references
    assortment optimization
    0 references
    bi-objective optimization
    0 references
    customer satisfaction
    0 references
    ranked-based choice model
    0 references
    augmented \(\varepsilon \)-constraint method
    0 references

    Identifiers