Approximation of the competitive facility location problem with MIPs (Q1725607): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2018.12.010 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Competitive facility location: the Voronoi game / 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: Exact method for the capacitated competitive facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive facility location problem with a free choice of suppliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized coverage: new developments in covering location models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened formulation for the simple plant location problem with order / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Location on a Network / 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: Competitive spatial models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent insights in Huff-like competitive facility location and design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A planar single-facility competitive location and design problem under the multi-deterministic choice rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition without separability: a computational study for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed-integer bilevel programming approach for a competitive prioritized set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Discrete Competitive Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential competitive location on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive location and pricing on networks with random utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A leader-follower game in competitive facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncooperative facility location games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi Games on Cycle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized local search for the discrete competitive facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of the discrete competitive facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixed Integer Linear Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple voting location and single voting location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibria in location games on a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The leader-follower location model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral study of simple plant location problem with order / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128744135 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2018.12.010 / rank
 
Normal rank

Latest revision as of 05:58, 11 December 2024

scientific article
Language Label Description Also known as
English
Approximation of the competitive facility location problem with MIPs
scientific article

    Statements

    Approximation of the competitive facility location problem with MIPs (English)
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    location
    0 references
    Stackelberg game
    0 references
    bi-level programming
    0 references
    cut generation
    0 references
    branch-and-bound
    0 references

    Identifiers