Customer allocation in maximum capture problems
From MaRDI portal
Publication:2392543
DOI10.1007/S10852-012-9185-5zbMATH Open1306.90077OpenAlexW2054031083MaRDI QIDQ2392543FDOQ2392543
Authors: Arifusalam Shaikh, Said Salhi, Malick M. Ndiaye
Publication date: 1 August 2013
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-012-9185-5
Recommendations
- The maximum capture problem with heterogeneous customers
- The maximum capture problem with random utilities: problem formulation and algorithms
- The Maximum Capture Problem Including Relocation
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- A capacitated competitive facility location problem
Cites Work
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- Incorporating waiting time in competitive location models
- A hierarchical location model for public facility planning
- Closest assignment constraints and location models: Properties and structure
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Competitive spatial models
- The maximum-capture hierarchical location problem
- The Maximum Capture Problem Including Relocation
- Title not available (Why is that?)
- Facilities location in a competitive environment: A Promethee based multiple criteria analysis
- A new chance-constrained maximum capture location problem
Cited In (4)
Uses Software
This page was built for publication: Customer allocation in maximum capture problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392543)