Abstract
In this paper, we analyze flexible models for capacitated discrete location problems with setup costs. We introduce a major extension with regards to standard models which consists of distinguishing three different points of view of a location problem in a logistics system. We develop mathematical programming formulations for these models using discrete ordered objective functions with some new features. We report on the computational behavior of these formulations tested on a randomly generated battery of instances.
| Original language | English |
|---|---|
| Pages (from-to) | 203-222 |
| Number of pages | 20 |
| Journal | TOP |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2010 |
Keywords / Materials (for Non-textual outputs)
- Discrete location
- Mixed integer programming
- Strategic planning