Competitive Facility Location with Selfish Users and Queues (Q5126616): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1287/opre.2018.1781 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2922570500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing capacity, pricing and location decisions on a congested network with balking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum capture problem with random utilities: problem formulation and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithm for a competitive facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of congestion models in the location of facilities with immobile servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise linear approximation of functions of two variables in MILP models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The congested facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A leader-follower model for discrete competitive facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of linear reformulations for multinomial logit choice probabilities in facility location models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating new facilities in a competitive environment / 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: Market and Locational Equilibrium for Two Competitors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design problem with congestion effects: A case of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach to the solution of a pricing model with continuous demand segmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of multiple-server congestible facilities for maximizing expected demand, when services are non-essential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical location-allocation models for congested systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location for market capture when users rank facilities by shorter travel and waiting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of a class of location-allocation problems with stochastic demand and congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of client choice on preventive healthcare facility network design / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128181675 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/OPRE.2018.1781 / rank
 
Normal rank

Latest revision as of 16:02, 30 December 2024

scientific article; zbMATH DE number 7262441
Language Label Description Also known as
English
Competitive Facility Location with Selfish Users and Queues
scientific article; zbMATH DE number 7262441

    Statements

    Competitive Facility Location with Selfish Users and Queues (English)
    0 references
    0 references
    0 references
    20 October 2020
    0 references
    location
    0 references
    bilevel programming
    0 references
    equilibrium
    0 references
    queueing
    0 references
    nonconvex
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references