Customer allocation in maximum capture problems
From MaRDI portal
Publication:2392543
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
- scientific article; zbMATH DE number 1253057 (Why is no real title available?)
- A branch-and-cut method for the obnoxious \(p\)-median problem
- A hierarchical location model for public facility planning
- A new chance-constrained maximum capture location problem
- Closest assignment constraints and location models: Properties and structure
- Competitive spatial models
- Facilities location in a competitive environment: A Promethee based multiple criteria analysis
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- Incorporating waiting time in competitive location models
- The Maximum Capture Problem Including Relocation
- The maximum-capture hierarchical location problem
Cited in
(4)
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)