Solving a Huff-like Stackelberg location problem on networks (Q5964240): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Continuous location problems and big triangle small triangle: Constructing better bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-facility huff location problems on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROFIL/BIAS - A fast interval library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive facility location and design with reactions of competitors already in the market / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a branch-and-bound approach for a Huff-like Stackelberg location problem / rank
 
Normal rank

Latest revision as of 11:43, 11 July 2024

scientific article; zbMATH DE number 6546934
Language Label Description Also known as
English
Solving a Huff-like Stackelberg location problem on networks
scientific article; zbMATH DE number 6546934

    Statements

    Solving a Huff-like Stackelberg location problem on networks (English)
    0 references
    0 references
    0 references
    29 February 2016
    0 references
    Stackelberg problem
    0 references
    bilevel optimization
    0 references
    branch and bound
    0 references
    interval analysis
    0 references
    DC decomposition
    0 references

    Identifiers