Computational complexity of the discrete competitive facility location problem

DOI10.1134/S1990478914040139zbMATH Open1324.90108OpenAlexW1974407940MaRDI QIDQ5264752FDOQ5264752

Andrey Melnikov

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478914040139

Recommendations

• scientific article; zbMATH DE number 6006831
• Competitive facility location models
• Discrete competitive facility location: modeling and optimization approaches
• Randomized local search for the discrete competitive facility location problem
• Approximate algorithms for the competitive facility location problem

zbMATH Keywords

bilevel programmingpolynomial hierarchyStackelberg game

Mathematics Subject Classification ID

Noncooperative games (91A10) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Foundations of bilevel programming
• Title not available (Why is that?)
• Competitive facility location models
• On the complexity of the \((r|p)\)-centroid problem in the plane
• The polynomial-time hierarchy
• A strengthened formulation for the simple plant location problem with order
• The simple plant location problem: Survey and synthesis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branch-and-bound algorithm for a competitive facility location problem
• Local search algorithms for the problem of competitive location of enterprises
• New lower bounds for the facility location problem with clients' preferences
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Approximation of the competitive facility location problem with MIPs
• Discrete Competitive Facility Location: Modeling and Optimization Approaches
• Exact method for the capacitated competitive facility location problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stochastic problem of competitive location of facilities with quantile criterion

This page was built for publication: Computational complexity of the discrete competitive facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264752)